./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/avg_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9b86a6fa-875c-4b17-9db0-416e8d94b8bd/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9b86a6fa-875c-4b17-9db0-416e8d94b8bd/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9b86a6fa-875c-4b17-9db0-416e8d94b8bd/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9b86a6fa-875c-4b17-9db0-416e8d94b8bd/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/avg_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9b86a6fa-875c-4b17-9db0-416e8d94b8bd/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9b86a6fa-875c-4b17-9db0-416e8d94b8bd/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 704389633f786b8f459e07240134137dbbeaeb7e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 16:44:01,291 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 16:44:01,292 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 16:44:01,300 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 16:44:01,301 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 16:44:01,301 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 16:44:01,302 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 16:44:01,303 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 16:44:01,304 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 16:44:01,305 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 16:44:01,306 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 16:44:01,306 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 16:44:01,306 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 16:44:01,307 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 16:44:01,308 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 16:44:01,308 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 16:44:01,309 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 16:44:01,310 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 16:44:01,311 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 16:44:01,312 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 16:44:01,313 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 16:44:01,314 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 16:44:01,315 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 16:44:01,316 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 16:44:01,316 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 16:44:01,317 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 16:44:01,317 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 16:44:01,318 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 16:44:01,318 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 16:44:01,319 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 16:44:01,319 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 16:44:01,320 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 16:44:01,320 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 16:44:01,320 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 16:44:01,321 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 16:44:01,321 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 16:44:01,321 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9b86a6fa-875c-4b17-9db0-416e8d94b8bd/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-08 16:44:01,332 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 16:44:01,332 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 16:44:01,333 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 16:44:01,333 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 16:44:01,334 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 16:44:01,334 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 16:44:01,334 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 16:44:01,334 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 16:44:01,334 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 16:44:01,334 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 16:44:01,334 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 16:44:01,335 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 16:44:01,335 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 16:44:01,335 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 16:44:01,335 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 16:44:01,335 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 16:44:01,335 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 16:44:01,335 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 16:44:01,335 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 16:44:01,335 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 16:44:01,336 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 16:44:01,336 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 16:44:01,336 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 16:44:01,336 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 16:44:01,336 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 16:44:01,336 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 16:44:01,336 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 16:44:01,336 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 16:44:01,337 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 16:44:01,337 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 16:44:01,337 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 16:44:01,337 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 16:44:01,337 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_9b86a6fa-875c-4b17-9db0-416e8d94b8bd/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 -> 704389633f786b8f459e07240134137dbbeaeb7e [2018-12-08 16:44:01,355 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 16:44:01,362 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 16:44:01,364 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 16:44:01,365 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 16:44:01,365 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 16:44:01,366 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9b86a6fa-875c-4b17-9db0-416e8d94b8bd/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/avg_true-unreach-call_true-termination.i [2018-12-08 16:44:01,402 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9b86a6fa-875c-4b17-9db0-416e8d94b8bd/bin-2019/uautomizer/data/98122dd43/4a347246d4ff494abae5f9d65a1b2c25/FLAG73e5c5d0b [2018-12-08 16:44:01,814 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 16:44:01,814 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9b86a6fa-875c-4b17-9db0-416e8d94b8bd/sv-benchmarks/c/reducercommutativity/avg_true-unreach-call_true-termination.i [2018-12-08 16:44:01,818 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9b86a6fa-875c-4b17-9db0-416e8d94b8bd/bin-2019/uautomizer/data/98122dd43/4a347246d4ff494abae5f9d65a1b2c25/FLAG73e5c5d0b [2018-12-08 16:44:01,826 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9b86a6fa-875c-4b17-9db0-416e8d94b8bd/bin-2019/uautomizer/data/98122dd43/4a347246d4ff494abae5f9d65a1b2c25 [2018-12-08 16:44:01,827 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 16:44:01,828 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 16:44:01,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 16:44:01,829 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 16:44:01,831 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 16:44:01,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:44:01" (1/1) ... [2018-12-08 16:44:01,833 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@343f3083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:44:01, skipping insertion in model container [2018-12-08 16:44:01,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:44:01" (1/1) ... [2018-12-08 16:44:01,837 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 16:44:01,846 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 16:44:01,934 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 16:44:01,940 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 16:44:01,951 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 16:44:01,960 INFO L195 MainTranslator]: Completed translation [2018-12-08 16:44:01,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:44:01 WrapperNode [2018-12-08 16:44:01,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 16:44:01,961 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 16:44:01,961 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 16:44:01,961 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 16:44:01,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:44:01" (1/1) ... [2018-12-08 16:44:01,970 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:44:01" (1/1) ... [2018-12-08 16:44:02,017 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 16:44:02,017 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 16:44:02,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 16:44:02,017 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 16:44:02,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:44:01" (1/1) ... [2018-12-08 16:44:02,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:44:01" (1/1) ... [2018-12-08 16:44:02,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:44:01" (1/1) ... [2018-12-08 16:44:02,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:44:01" (1/1) ... [2018-12-08 16:44:02,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:44:01" (1/1) ... [2018-12-08 16:44:02,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:44:01" (1/1) ... [2018-12-08 16:44:02,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:44:01" (1/1) ... [2018-12-08 16:44:02,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 16:44:02,039 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 16:44:02,039 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 16:44:02,039 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 16:44:02,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:44:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b86a6fa-875c-4b17-9db0-416e8d94b8bd/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 16:44:02,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 16:44:02,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 16:44:02,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 16:44:02,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 16:44:02,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 16:44:02,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 16:44:02,218 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 16:44:02,218 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-12-08 16:44:02,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:44:02 BoogieIcfgContainer [2018-12-08 16:44:02,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 16:44:02,219 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 16:44:02,219 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 16:44:02,222 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 16:44:02,222 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 16:44:02,222 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 04:44:01" (1/3) ... [2018-12-08 16:44:02,223 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a3037be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 04:44:02, skipping insertion in model container [2018-12-08 16:44:02,223 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 16:44:02,223 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:44:01" (2/3) ... [2018-12-08 16:44:02,224 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a3037be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 04:44:02, skipping insertion in model container [2018-12-08 16:44:02,224 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 16:44:02,224 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:44:02" (3/3) ... [2018-12-08 16:44:02,225 INFO L375 chiAutomizerObserver]: Analyzing ICFG avg_true-unreach-call_true-termination.i [2018-12-08 16:44:02,259 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 16:44:02,259 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 16:44:02,260 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 16:44:02,260 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 16:44:02,260 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 16:44:02,260 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 16:44:02,260 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 16:44:02,260 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 16:44:02,260 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 16:44:02,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-12-08 16:44:02,283 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-08 16:44:02,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 16:44:02,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 16:44:02,287 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-08 16:44:02,287 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 16:44:02,288 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 16:44:02,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-12-08 16:44:02,289 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-08 16:44:02,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 16:44:02,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 16:44:02,289 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-08 16:44:02,289 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 16:44:02,294 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 14#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 13#L20true assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 9#L11-3true [2018-12-08 16:44:02,294 INFO L796 eck$LassoCheckResult]: Loop: 9#L11-3true assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 12#L11-2true avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 9#L11-3true [2018-12-08 16:44:02,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:44:02,298 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-12-08 16:44:02,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:44:02,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:44:02,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:02,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:44:02,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:02,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:44:02,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1379, now seen corresponding path program 1 times [2018-12-08 16:44:02,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:44:02,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:44:02,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:02,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:44:02,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:02,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:44:02,379 INFO L82 PathProgramCache]: Analyzing trace with hash 28693956, now seen corresponding path program 1 times [2018-12-08 16:44:02,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:44:02,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:44:02,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:02,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:44:02,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:02,515 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 16:44:02,516 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 16:44:02,516 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 16:44:02,516 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 16:44:02,516 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 16:44:02,516 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 16:44:02,516 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 16:44:02,516 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 16:44:02,516 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-12-08 16:44:02,516 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 16:44:02,516 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 16:44:02,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:02,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:02,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:02,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:02,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:02,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:02,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:02,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:02,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:02,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:02,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:02,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:02,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:02,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:02,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:02,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:02,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:02,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:02,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:02,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:02,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:02,774 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 16:44:02,777 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 16:44:02,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:02,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:02,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:02,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:02,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:02,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:02,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:02,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:02,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:02,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:02,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:02,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:02,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:02,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:02,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:02,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:02,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:02,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:02,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:02,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:02,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:02,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:02,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:02,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:02,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:02,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:02,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:02,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:02,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:02,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:02,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:02,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:02,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:02,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:02,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:02,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:02,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:02,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:02,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:02,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:02,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:02,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:02,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:02,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:02,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:02,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:02,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:02,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:02,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:02,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:02,799 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:44:02,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:44:02,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:02,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:02,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:02,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:02,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:02,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:02,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:02,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:02,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:02,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:02,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:02,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:02,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:02,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:02,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:02,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:02,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:02,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:02,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:02,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:02,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:02,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:02,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:02,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:02,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:02,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:02,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:02,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:02,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:02,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:02,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:02,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:02,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:02,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:02,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:02,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:02,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:02,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:02,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:02,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:02,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:02,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:02,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:02,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:02,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:02,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:02,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:02,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:02,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:02,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:02,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:02,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:44:02,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:44:02,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:02,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:02,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:02,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:02,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:02,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:02,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:02,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:02,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:02,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:02,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:02,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:02,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:02,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:02,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:02,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:02,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:02,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:02,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:02,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:02,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:02,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:02,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:02,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:02,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:02,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:02,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:02,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:02,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:02,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:02,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:02,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:02,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:02,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:02,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:02,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:02,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:02,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:02,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:02,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:02,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:02,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:02,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:02,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:02,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:02,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:02,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:02,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:02,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:02,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:02,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:02,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:02,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:02,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:02,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:02,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:02,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:02,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:02,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:02,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:02,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:02,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:02,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:02,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:02,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:02,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:02,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:02,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:02,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:02,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:02,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:02,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:02,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:02,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:02,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:02,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:02,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:02,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:02,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:44:02,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:44:02,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:02,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:02,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:02,853 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 16:44:02,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:02,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:02,855 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 16:44:02,855 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:44:02,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:02,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:02,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:02,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:02,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:02,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:02,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:44:02,866 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:44:02,886 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 16:44:02,913 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 16:44:02,913 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-08 16:44:02,914 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 16:44:02,915 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 16:44:02,916 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 16:44:02,916 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_avg_~x.offset, ULTIMATE.start_avg_~i~0, v_rep(select #length ULTIMATE.start_avg_~x.base)_1) = -1*ULTIMATE.start_avg_~x.offset - 4*ULTIMATE.start_avg_~i~0 + 1*v_rep(select #length ULTIMATE.start_avg_~x.base)_1 Supporting invariants [] [2018-12-08 16:44:02,933 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-08 16:44:02,939 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 16:44:02,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:44:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:44:02,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:44:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:44:02,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:44:02,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:44:03,009 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 16:44:03,010 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 3 states. [2018-12-08 16:44:03,042 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 3 states. Result 51 states and 69 transitions. Complement of second has 8 states. [2018-12-08 16:44:03,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 16:44:03,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 16:44:03,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2018-12-08 16:44:03,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 3 letters. Loop has 2 letters. [2018-12-08 16:44:03,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:44:03,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-08 16:44:03,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:44:03,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 3 letters. Loop has 4 letters. [2018-12-08 16:44:03,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:44:03,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 69 transitions. [2018-12-08 16:44:03,049 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-08 16:44:03,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 17 states and 23 transitions. [2018-12-08 16:44:03,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-08 16:44:03,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-12-08 16:44:03,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2018-12-08 16:44:03,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 16:44:03,053 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-12-08 16:44:03,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2018-12-08 16:44:03,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-08 16:44:03,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-08 16:44:03,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-12-08 16:44:03,070 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-12-08 16:44:03,070 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-12-08 16:44:03,070 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 16:44:03,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2018-12-08 16:44:03,071 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-08 16:44:03,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 16:44:03,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 16:44:03,071 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-08 16:44:03,071 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 16:44:03,072 INFO L794 eck$LassoCheckResult]: Stem: 142#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 141#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 140#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 136#L11-3 assume !(avg_~i~0 < ~N~0); 132#L11-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 133#L14 main_#t~ret3 := avg_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 145#L11-8 [2018-12-08 16:44:03,072 INFO L796 eck$LassoCheckResult]: Loop: 145#L11-8 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 146#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 145#L11-8 [2018-12-08 16:44:03,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:44:03,072 INFO L82 PathProgramCache]: Analyzing trace with hash 889510859, now seen corresponding path program 1 times [2018-12-08 16:44:03,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:44:03,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:44:03,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:03,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:44:03,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:03,076 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-08 16:44:03,076 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-08 16:44:03,077 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b86a6fa-875c-4b17-9db0-416e8d94b8bd/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-08 16:44:03,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:44:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:44:03,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:44:03,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:44:03,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:44:03,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:44:03,120 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 16:44:03,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:44:03,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2018-12-08 16:44:03,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:44:03,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:44:03,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:03,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:44:03,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:03,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:44:03,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:44:03,146 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-08 16:44:03,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:44:03,183 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-12-08 16:44:03,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:44:03,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2018-12-08 16:44:03,184 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-08 16:44:03,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2018-12-08 16:44:03,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-12-08 16:44:03,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-12-08 16:44:03,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-12-08 16:44:03,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 16:44:03,185 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-08 16:44:03,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-12-08 16:44:03,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-12-08 16:44:03,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-08 16:44:03,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-12-08 16:44:03,186 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-12-08 16:44:03,186 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-12-08 16:44:03,186 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 16:44:03,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-12-08 16:44:03,187 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-08 16:44:03,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 16:44:03,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 16:44:03,187 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:44:03,187 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 16:44:03,187 INFO L794 eck$LassoCheckResult]: Stem: 198#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 197#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 196#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 192#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 193#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 194#L11-3 assume !(avg_~i~0 < ~N~0); 188#L11-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 189#L14 main_#t~ret3 := avg_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 201#L11-8 [2018-12-08 16:44:03,187 INFO L796 eck$LassoCheckResult]: Loop: 201#L11-8 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 202#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 201#L11-8 [2018-12-08 16:44:03,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:44:03,188 INFO L82 PathProgramCache]: Analyzing trace with hash 123162473, now seen corresponding path program 1 times [2018-12-08 16:44:03,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:44:03,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:44:03,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:03,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:44:03,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:03,193 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-08 16:44:03,193 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-08 16:44:03,193 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b86a6fa-875c-4b17-9db0-416e8d94b8bd/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-08 16:44:03,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:44:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:44:03,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:44:03,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:44:03,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-08 16:44:03,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-12-08 16:44:03,248 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 16:44:03,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:44:03,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 2 times [2018-12-08 16:44:03,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:44:03,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:44:03,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:03,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:44:03,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:03,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:03,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:44:03,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:44:03,303 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-12-08 16:44:03,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:44:03,337 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-12-08 16:44:03,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 16:44:03,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2018-12-08 16:44:03,338 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-08 16:44:03,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2018-12-08 16:44:03,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-12-08 16:44:03,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-12-08 16:44:03,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-12-08 16:44:03,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 16:44:03,339 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-08 16:44:03,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-12-08 16:44:03,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-12-08 16:44:03,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-08 16:44:03,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-12-08 16:44:03,340 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-12-08 16:44:03,340 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-12-08 16:44:03,341 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 16:44:03,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2018-12-08 16:44:03,341 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-08 16:44:03,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 16:44:03,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 16:44:03,342 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-12-08 16:44:03,342 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 16:44:03,342 INFO L794 eck$LassoCheckResult]: Stem: 264#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 263#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 262#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 257#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 258#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 259#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 260#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 269#L11-3 assume !(avg_~i~0 < ~N~0); 253#L11-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 254#L14 main_#t~ret3 := avg_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 267#L11-8 [2018-12-08 16:44:03,342 INFO L796 eck$LassoCheckResult]: Loop: 267#L11-8 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 268#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 267#L11-8 [2018-12-08 16:44:03,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:44:03,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1898228857, now seen corresponding path program 2 times [2018-12-08 16:44:03,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:44:03,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:44:03,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:03,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:44:03,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:03,349 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-08 16:44:03,349 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-08 16:44:03,349 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b86a6fa-875c-4b17-9db0-416e8d94b8bd/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-08 16:44:03,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 16:44:03,369 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 16:44:03,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-12-08 16:44:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:03,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:44:03,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 3 times [2018-12-08 16:44:03,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:44:03,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:44:03,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:03,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:44:03,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:03,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:44:03,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1163170153, now seen corresponding path program 1 times [2018-12-08 16:44:03,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:44:03,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:44:03,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:03,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:44:03,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:03,404 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-08 16:44:03,405 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-08 16:44:03,405 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b86a6fa-875c-4b17-9db0-416e8d94b8bd/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-08 16:44:03,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:44:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:04,377 WARN L180 SmtUtils]: Spent 907.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 116 [2018-12-08 16:44:06,273 WARN L180 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2018-12-08 16:44:06,275 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 16:44:06,275 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 16:44:06,275 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 16:44:06,275 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 16:44:06,275 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 16:44:06,275 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 16:44:06,275 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 16:44:06,275 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 16:44:06,275 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg_true-unreach-call_true-termination.i_Iteration4_Lasso [2018-12-08 16:44:06,275 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 16:44:06,275 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 16:44:06,277 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-08 16:44:06,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:06,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:06,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:06,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:06,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:06,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:06,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:06,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:06,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:06,336 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 29 [2018-12-08 16:44:07,133 WARN L180 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2018-12-08 16:44:07,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-12-08 16:44:07,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:07,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-12-08 16:44:07,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-12-08 16:44:07,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:07,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:07,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-12-08 16:44:07,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-12-08 16:44:07,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-12-08 16:44:07,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:07,156 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-08 16:44:07,809 WARN L180 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 94 [2018-12-08 16:44:07,822 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-08 16:44:09,066 WARN L180 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2018-12-08 16:44:09,080 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 16:44:09,080 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 16:44:09,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:09,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:09,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:09,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:09,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:09,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:09,081 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:09,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:09,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:09,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:09,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:09,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:09,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:09,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:09,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:09,082 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:09,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:09,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:09,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:09,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:09,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:09,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:09,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:09,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:09,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:09,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:09,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:09,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:09,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:09,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:09,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:09,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:09,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:09,085 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:09,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:09,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:09,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:09,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:09,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:09,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:09,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:09,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:44:09,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:44:09,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:09,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:09,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:09,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:09,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:09,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:09,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:09,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:09,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:09,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:09,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:09,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:09,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:09,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:09,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:09,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:09,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:09,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:09,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:09,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:09,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:09,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:09,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:09,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:09,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:09,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:09,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:09,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:09,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:09,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:09,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:09,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:09,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:09,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:09,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:09,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:09,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:09,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:09,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:09,094 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 16:44:09,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:09,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:09,095 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 16:44:09,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:44:09,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:09,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:09,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:09,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:09,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:09,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:09,102 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:44:09,102 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:44:09,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:09,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:09,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:09,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:09,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:09,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:09,105 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:44:09,105 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:44:09,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:09,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:09,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:09,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:09,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:09,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:09,107 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:44:09,107 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:44:09,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:09,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:09,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:09,113 INFO L205 nArgumentSynthesizer]: 6 stem disjuncts [2018-12-08 16:44:09,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:09,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:09,119 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-08 16:44:09,119 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:44:09,178 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 16:44:09,215 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-12-08 16:44:09,215 INFO L444 ModelExtractionUtils]: 21 out of 31 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-08 16:44:09,216 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 16:44:09,216 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 16:44:09,217 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 16:44:09,217 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_avg_~x.offset, v_rep(select #length ULTIMATE.start_avg_~x.base)_2, ULTIMATE.start_avg_~i~0) = -1*ULTIMATE.start_avg_~x.offset + 1*v_rep(select #length ULTIMATE.start_avg_~x.base)_2 - 4*ULTIMATE.start_avg_~i~0 Supporting invariants [] [2018-12-08 16:44:09,226 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-08 16:44:09,227 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 16:44:09,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:44:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:44:09,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:44:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:44:09,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:44:09,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:44:09,261 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 16:44:09,261 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-12-08 16:44:09,279 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 26 states and 33 transitions. Complement of second has 7 states. [2018-12-08 16:44:09,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 16:44:09,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 16:44:09,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-08 16:44:09,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 2 letters. [2018-12-08 16:44:09,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:44:09,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 2 letters. [2018-12-08 16:44:09,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:44:09,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2018-12-08 16:44:09,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:44:09,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2018-12-08 16:44:09,282 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-08 16:44:09,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 24 transitions. [2018-12-08 16:44:09,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-08 16:44:09,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-08 16:44:09,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2018-12-08 16:44:09,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 16:44:09,283 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-12-08 16:44:09,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2018-12-08 16:44:09,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-08 16:44:09,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-08 16:44:09,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2018-12-08 16:44:09,284 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-12-08 16:44:09,284 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-12-08 16:44:09,284 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 16:44:09,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2018-12-08 16:44:09,285 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-08 16:44:09,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 16:44:09,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 16:44:09,285 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:44:09,285 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 16:44:09,285 INFO L794 eck$LassoCheckResult]: Stem: 385#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 384#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 383#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 378#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 379#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 380#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 381#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 391#L11-3 assume !(avg_~i~0 < ~N~0); 374#L11-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 375#L14 main_#t~ret3 := avg_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 388#L11-8 assume !(avg_~i~0 < ~N~0); 386#L11-9 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 387#L14-1 main_#t~ret6 := avg_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 376#L32-3 [2018-12-08 16:44:09,286 INFO L796 eck$LassoCheckResult]: Loop: 376#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 377#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 376#L32-3 [2018-12-08 16:44:09,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:44:09,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1698534614, now seen corresponding path program 1 times [2018-12-08 16:44:09,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:44:09,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:44:09,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:09,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:44:09,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:09,290 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-08 16:44:09,291 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-08 16:44:09,291 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b86a6fa-875c-4b17-9db0-416e8d94b8bd/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-08 16:44:09,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:44:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:44:09,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:44:09,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 16:44:09,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:44:09,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 16:44:09,332 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 16:44:09,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:44:09,332 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 1 times [2018-12-08 16:44:09,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:44:09,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:44:09,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:09,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:44:09,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:09,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:44:09,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:44:09,366 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-12-08 16:44:09,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:44:09,414 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-12-08 16:44:09,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 16:44:09,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2018-12-08 16:44:09,415 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-08 16:44:09,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 26 transitions. [2018-12-08 16:44:09,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-08 16:44:09,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-08 16:44:09,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2018-12-08 16:44:09,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 16:44:09,415 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-12-08 16:44:09,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2018-12-08 16:44:09,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-12-08 16:44:09,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-08 16:44:09,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-12-08 16:44:09,416 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-08 16:44:09,416 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-08 16:44:09,416 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 16:44:09,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-12-08 16:44:09,417 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-08 16:44:09,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 16:44:09,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 16:44:09,417 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:44:09,417 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 16:44:09,417 INFO L794 eck$LassoCheckResult]: Stem: 471#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 470#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 469#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 464#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 465#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 466#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 467#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 477#L11-3 assume !(avg_~i~0 < ~N~0); 460#L11-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 461#L14 main_#t~ret3 := avg_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 474#L11-8 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 475#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 476#L11-8 assume !(avg_~i~0 < ~N~0); 472#L11-9 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 473#L14-1 main_#t~ret6 := avg_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 462#L32-3 [2018-12-08 16:44:09,417 INFO L796 eck$LassoCheckResult]: Loop: 462#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 463#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 462#L32-3 [2018-12-08 16:44:09,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:44:09,417 INFO L82 PathProgramCache]: Analyzing trace with hash 205910964, now seen corresponding path program 1 times [2018-12-08 16:44:09,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:44:09,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:44:09,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:09,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:44:09,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:09,422 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-08 16:44:09,422 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-08 16:44:09,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b86a6fa-875c-4b17-9db0-416e8d94b8bd/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-08 16:44:09,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:44:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:44:09,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:44:09,464 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 16:44:09,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-08 16:44:09,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-12-08 16:44:09,489 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 16:44:09,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:44:09,489 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 2 times [2018-12-08 16:44:09,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:44:09,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:44:09,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:09,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:44:09,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:09,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 16:44:09,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:44:09,524 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-12-08 16:44:09,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:44:09,559 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-12-08 16:44:09,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 16:44:09,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 31 transitions. [2018-12-08 16:44:09,559 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-08 16:44:09,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 31 transitions. [2018-12-08 16:44:09,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-12-08 16:44:09,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-12-08 16:44:09,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2018-12-08 16:44:09,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 16:44:09,560 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-12-08 16:44:09,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2018-12-08 16:44:09,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2018-12-08 16:44:09,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-08 16:44:09,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-12-08 16:44:09,562 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-12-08 16:44:09,562 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-12-08 16:44:09,562 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-08 16:44:09,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2018-12-08 16:44:09,562 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-08 16:44:09,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 16:44:09,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 16:44:09,563 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:44:09,563 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 16:44:09,563 INFO L794 eck$LassoCheckResult]: Stem: 569#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 568#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 567#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 562#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 563#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 564#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 565#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 576#L11-3 assume !(avg_~i~0 < ~N~0); 558#L11-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 559#L14 main_#t~ret3 := avg_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 572#L11-8 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 573#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 574#L11-8 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 575#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 577#L11-8 assume !(avg_~i~0 < ~N~0); 570#L11-9 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 571#L14-1 main_#t~ret6 := avg_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 560#L32-3 [2018-12-08 16:44:09,563 INFO L796 eck$LassoCheckResult]: Loop: 560#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 561#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 560#L32-3 [2018-12-08 16:44:09,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:44:09,563 INFO L82 PathProgramCache]: Analyzing trace with hash 313660178, now seen corresponding path program 2 times [2018-12-08 16:44:09,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:44:09,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:44:09,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:09,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:44:09,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:09,568 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-08 16:44:09,568 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-08 16:44:09,568 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b86a6fa-875c-4b17-9db0-416e8d94b8bd/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-08 16:44:09,574 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 16:44:09,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 16:44:09,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-12-08 16:44:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:09,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:44:09,627 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 3 times [2018-12-08 16:44:09,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:44:09,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:44:09,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:09,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:44:09,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:09,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:44:09,631 INFO L82 PathProgramCache]: Analyzing trace with hash 779721780, now seen corresponding path program 1 times [2018-12-08 16:44:09,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:44:09,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:44:09,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:09,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:44:09,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:09,633 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-08 16:44:09,634 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-08 16:44:09,634 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b86a6fa-875c-4b17-9db0-416e8d94b8bd/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-08 16:44:09,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:44:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:10,576 WARN L180 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 158 [2018-12-08 16:44:29,030 WARN L180 SmtUtils]: Spent 18.07 s on a formula simplification. DAG size of input: 415 DAG size of output: 111 [2018-12-08 16:44:29,032 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 16:44:29,032 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 16:44:29,033 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 16:44:29,033 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 16:44:29,033 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 16:44:29,033 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 16:44:29,033 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 16:44:29,033 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 16:44:29,033 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg_true-unreach-call_true-termination.i_Iteration7_Lasso [2018-12-08 16:44:29,033 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 16:44:29,033 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 16:44:29,034 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-08 16:44:29,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:29,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:29,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-12-08 16:44:29,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:29,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:29,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-12-08 16:44:29,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:29,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:29,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:29,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:29,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:29,206 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 110 [2018-12-08 16:44:32,458 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 6893 conjuctions. This might take some time... [2018-12-08 16:44:32,499 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 6 conjuctions. [2018-12-08 16:44:33,655 WARN L180 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 108 DAG size of output: 97 [2018-12-08 16:44:33,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:33,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:33,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:33,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:33,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:44:33,699 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-08 16:44:38,258 WARN L180 SmtUtils]: Spent 4.49 s on a formula simplification. DAG size of input: 299 DAG size of output: 164 [2018-12-08 16:44:38,286 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2018-12-08 16:44:47,271 WARN L180 SmtUtils]: Spent 8.94 s on a formula simplification. DAG size of input: 203 DAG size of output: 148 [2018-12-08 16:44:47,307 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 16:44:47,307 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 16:44:47,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:47,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:47,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:47,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:47,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:47,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:47,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:47,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:47,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:47,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:47,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:47,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:47,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:47,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:47,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:47,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:47,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:47,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:47,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:47,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:47,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:47,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:47,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:47,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:44:47,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:44:47,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:47,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:47,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:47,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:47,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:47,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:47,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:47,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:47,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:47,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:47,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:47,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:47,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:47,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:47,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:47,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:47,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:47,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:47,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:47,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:47,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:47,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:47,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:47,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:47,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:47,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:47,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:47,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:47,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:47,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:47,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:47,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:47,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:47,315 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:44:47,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:44:47,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:47,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:47,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:47,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:47,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:47,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:47,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:47,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:47,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:47,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:47,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:47,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:47,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:47,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:47,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:47,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:47,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:47,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:47,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:47,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:47,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:47,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:44:47,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:47,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:47,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:47,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:44:47,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:44:47,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:47,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:47,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:47,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:44:47,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:47,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:47,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:44:47,320 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:44:47,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:44:47,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:44:47,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:44:47,323 INFO L205 nArgumentSynthesizer]: 6 stem disjuncts [2018-12-08 16:44:47,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:44:47,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:44:47,331 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-08 16:44:47,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:44:47,387 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 16:44:47,412 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 16:44:47,413 INFO L444 ModelExtractionUtils]: 57 out of 61 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 16:44:47,413 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 16:44:47,413 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 16:44:47,414 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 16:44:47,414 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ~N~0) = -1*ULTIMATE.start_main_~i~1 + 1*~N~0 Supporting invariants [] [2018-12-08 16:44:47,445 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-12-08 16:44:47,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:44:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:44:47,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:44:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:44:47,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:44:47,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:44:47,481 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 16:44:47,481 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-12-08 16:44:47,494 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 27 states and 34 transitions. Complement of second has 6 states. [2018-12-08 16:44:47,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 16:44:47,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 16:44:47,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-12-08 16:44:47,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 2 letters. [2018-12-08 16:44:47,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:44:47,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 19 letters. Loop has 2 letters. [2018-12-08 16:44:47,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:44:47,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 4 letters. [2018-12-08 16:44:47,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:44:47,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2018-12-08 16:44:47,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 16:44:47,497 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 27 transitions. [2018-12-08 16:44:47,497 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-08 16:44:47,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-08 16:44:47,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2018-12-08 16:44:47,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 16:44:47,497 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-12-08 16:44:47,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2018-12-08 16:44:47,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-08 16:44:47,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-08 16:44:47,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-12-08 16:44:47,499 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-12-08 16:44:47,499 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-12-08 16:44:47,499 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-08 16:44:47,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-12-08 16:44:47,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 16:44:47,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 16:44:47,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 16:44:47,500 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:44:47,500 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 16:44:47,500 INFO L794 eck$LassoCheckResult]: Stem: 735#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 734#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 733#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 728#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 729#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 730#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 731#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 742#L11-3 assume !(avg_~i~0 < ~N~0); 723#L11-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 724#L14 main_#t~ret3 := avg_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 738#L11-8 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 739#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 740#L11-8 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 741#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 743#L11-8 assume !(avg_~i~0 < ~N~0); 736#L11-9 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 737#L14-1 main_#t~ret6 := avg_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 725#L32-3 assume !(main_~i~1 < ~N~0 - 1); 721#L32-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 722#L11-13 [2018-12-08 16:44:47,500 INFO L796 eck$LassoCheckResult]: Loop: 722#L11-13 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 732#L11-12 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 722#L11-13 [2018-12-08 16:44:47,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:44:47,500 INFO L82 PathProgramCache]: Analyzing trace with hash 779721722, now seen corresponding path program 1 times [2018-12-08 16:44:47,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:44:47,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:44:47,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:47,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:44:47,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:47,504 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-08 16:44:47,504 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-08 16:44:47,504 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b86a6fa-875c-4b17-9db0-416e8d94b8bd/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-08 16:44:47,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:44:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:44:47,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:44:47,535 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 16:44:47,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:44:47,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 16:44:47,550 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 16:44:47,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:44:47,550 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 1 times [2018-12-08 16:44:47,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:44:47,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:44:47,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:47,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:44:47,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:47,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:44:47,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:44:47,570 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-12-08 16:44:47,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:44:47,586 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-12-08 16:44:47,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 16:44:47,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 27 transitions. [2018-12-08 16:44:47,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 16:44:47,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 27 transitions. [2018-12-08 16:44:47,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-08 16:44:47,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-08 16:44:47,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2018-12-08 16:44:47,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 16:44:47,587 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-12-08 16:44:47,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2018-12-08 16:44:47,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-12-08 16:44:47,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-08 16:44:47,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-12-08 16:44:47,588 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-12-08 16:44:47,588 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-12-08 16:44:47,588 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-08 16:44:47,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2018-12-08 16:44:47,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 16:44:47,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 16:44:47,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 16:44:47,588 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:44:47,588 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 16:44:47,589 INFO L794 eck$LassoCheckResult]: Stem: 843#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 842#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 841#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 836#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 837#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 838#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 839#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 850#L11-3 assume !(avg_~i~0 < ~N~0); 831#L11-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 832#L14 main_#t~ret3 := avg_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 846#L11-8 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 847#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 848#L11-8 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 849#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 851#L11-8 assume !(avg_~i~0 < ~N~0); 844#L11-9 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 845#L14-1 main_#t~ret6 := avg_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 833#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 834#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 835#L32-3 assume !(main_~i~1 < ~N~0 - 1); 829#L32-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 830#L11-13 [2018-12-08 16:44:47,589 INFO L796 eck$LassoCheckResult]: Loop: 830#L11-13 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 840#L11-12 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 830#L11-13 [2018-12-08 16:44:47,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:44:47,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1988322460, now seen corresponding path program 1 times [2018-12-08 16:44:47,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:44:47,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:44:47,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:47,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:44:47,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:47,591 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-08 16:44:47,591 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-08 16:44:47,591 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b86a6fa-875c-4b17-9db0-416e8d94b8bd/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-08 16:44:47,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:44:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:47,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:44:47,651 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 2 times [2018-12-08 16:44:47,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:44:47,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:44:47,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:47,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:44:47,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:47,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:44:47,654 INFO L82 PathProgramCache]: Analyzing trace with hash -482560770, now seen corresponding path program 1 times [2018-12-08 16:44:47,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 16:44:47,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 16:44:47,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:47,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:44:47,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:44:47,656 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-08 16:44:47,656 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-08 16:44:47,656 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b86a6fa-875c-4b17-9db0-416e8d94b8bd/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-08 16:44:47,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:44:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:44:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:45:05,683 WARN L180 SmtUtils]: Spent 17.95 s on a formula simplification. DAG size of input: 231 DAG size of output: 193 [2018-12-08 16:45:13,051 WARN L180 SmtUtils]: Spent 7.18 s on a formula simplification. DAG size of input: 230 DAG size of output: 116 [2018-12-08 16:45:13,053 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 16:45:13,053 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 16:45:13,053 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 16:45:13,053 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 16:45:13,054 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 16:45:13,054 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 16:45:13,054 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 16:45:13,054 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 16:45:13,054 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg_true-unreach-call_true-termination.i_Iteration9_Lasso [2018-12-08 16:45:13,054 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 16:45:13,054 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 16:45:13,055 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-08 16:45:13,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:45:13,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-12-08 16:45:13,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:45:13,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-12-08 16:45:13,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-12-08 16:45:13,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-12-08 16:45:13,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:45:13,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-12-08 16:45:13,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-12-08 16:45:13,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:45:13,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-12-08 16:45:13,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:45:13,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:45:13,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-12-08 16:45:13,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-12-08 16:45:13,215 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 109 [2018-12-08 16:45:15,240 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 5387 conjuctions. This might take some time... [2018-12-08 16:45:15,273 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 10 conjuctions. [2018-12-08 16:45:16,230 WARN L180 SmtUtils]: Spent 946.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 85 [2018-12-08 16:45:16,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:45:16,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:45:16,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 16:45:16,253 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-08 16:45:17,600 WARN L180 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 234 DAG size of output: 118 [2018-12-08 16:45:17,627 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-08 16:45:19,676 WARN L180 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 213 DAG size of output: 102 [2018-12-08 16:45:19,708 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 16:45:19,708 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 16:45:19,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:45:19,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:45:19,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:45:19,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:45:19,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:45:19,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:45:19,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:45:19,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:45:19,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:45:19,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:45:19,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:45:19,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:45:19,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:45:19,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:45:19,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:45:19,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:45:19,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:45:19,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:45:19,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:45:19,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:45:19,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:45:19,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:45:19,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:45:19,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:45:19,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:45:19,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:45:19,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:45:19,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:45:19,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:45:19,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:45:19,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:45:19,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:45:19,712 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:45:19,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:45:19,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:45:19,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:45:19,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:45:19,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:45:19,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:45:19,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:45:19,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:45:19,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:45:19,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:45:19,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:45:19,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:45:19,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:45:19,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:45:19,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:45:19,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:45:19,715 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:45:19,715 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:45:19,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:45:19,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:45:19,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:45:19,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:45:19,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:45:19,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:45:19,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:45:19,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:45:19,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:45:19,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:45:19,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:45:19,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:45:19,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:45:19,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:45:19,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:45:19,717 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 16:45:19,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:45:19,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:45:19,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:45:19,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:45:19,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:45:19,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:45:19,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:45:19,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:45:19,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:45:19,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:45:19,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:45:19,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:45:19,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:45:19,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:45:19,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:45:19,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:45:19,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:45:19,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:45:19,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:45:19,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:45:19,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:45:19,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:45:19,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:45:19,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:45:19,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:45:19,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:45:19,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:45:19,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:45:19,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:45:19,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:45:19,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:45:19,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:45:19,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:45:19,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:45:19,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:45:19,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:45:19,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:45:19,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:45:19,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:45:19,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:45:19,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:45:19,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:45:19,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:45:19,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:45:19,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:45:19,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:45:19,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:45:19,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:45:19,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:45:19,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 16:45:19,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 16:45:19,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:45:19,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:45:19,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 16:45:19,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 16:45:19,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 16:45:19,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 16:45:19,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 16:45:19,724 INFO L205 nArgumentSynthesizer]: 6 stem disjuncts [2018-12-08 16:45:19,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 16:45:19,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 16:45:19,727 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-08 16:45:19,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 16:45:19,751 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 16:45:19,770 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 16:45:19,770 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-08 16:45:19,770 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 16:45:19,771 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 16:45:19,771 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 16:45:19,771 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_avg_~i~0, ~N~0) = -1*ULTIMATE.start_avg_~i~0 + 1*~N~0 Supporting invariants [] [2018-12-08 16:45:19,781 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-08 16:45:19,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:45:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:45:19,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:45:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:45:19,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:45:19,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:45:19,808 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 16:45:19,808 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-12-08 16:45:19,812 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 25 states and 29 transitions. Complement of second has 4 states. [2018-12-08 16:45:19,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 16:45:19,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 16:45:19,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-12-08 16:45:19,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 21 letters. Loop has 2 letters. [2018-12-08 16:45:19,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:45:19,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 23 letters. Loop has 2 letters. [2018-12-08 16:45:19,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:45:19,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 21 letters. Loop has 4 letters. [2018-12-08 16:45:19,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 16:45:19,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2018-12-08 16:45:19,814 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 16:45:19,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2018-12-08 16:45:19,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 16:45:19,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 16:45:19,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 16:45:19,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 16:45:19,814 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 16:45:19,814 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 16:45:19,814 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 16:45:19,814 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-08 16:45:19,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 16:45:19,814 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 16:45:19,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 16:45:19,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 04:45:19 BoogieIcfgContainer [2018-12-08 16:45:19,818 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 16:45:19,819 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 16:45:19,819 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 16:45:19,819 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 16:45:19,819 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:44:02" (3/4) ... [2018-12-08 16:45:19,821 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 16:45:19,821 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 16:45:19,822 INFO L168 Benchmark]: Toolchain (without parser) took 77994.07 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -187.4 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-12-08 16:45:19,822 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 16:45:19,823 INFO L168 Benchmark]: CACSL2BoogieTranslator took 131.67 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-08 16:45:19,823 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 941.5 MB in the beginning and 1.1 GB in the end (delta: -179.7 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-08 16:45:19,823 INFO L168 Benchmark]: Boogie Preprocessor took 21.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 16:45:19,823 INFO L168 Benchmark]: RCFGBuilder took 179.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-12-08 16:45:19,824 INFO L168 Benchmark]: BuchiAutomizer took 77599.63 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -37.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-12-08 16:45:19,824 INFO L168 Benchmark]: Witness Printer took 2.73 ms. Allocated memory is still 2.8 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 16:45:19,826 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 131.67 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.5 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 56.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 941.5 MB in the beginning and 1.1 GB in the end (delta: -179.7 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 179.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 77599.63 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -37.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 2.73 ms. Allocated memory is still 2.8 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (5 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x + -4 * i + unknown-#length-unknown[x] and consists of 5 locations. One deterministic module has affine ranking function -1 * x + unknown-#length-unknown[x] + -4 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 77.5s and 10 iterations. TraceHistogramMax:2. Analysis of lassos took 77.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 12 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 23 states and ocurred in iteration 7. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 104 SDtfs, 99 SDslu, 26 SDs, 0 SdLazy, 186 SolverSat, 22 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU5 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital1039 mio100 ax100 hnf99 lsp452 ukn32 mio100 lsp366 div63 bol100 ite100 ukn100 eq168 hnf93 smp43 dnf1841 smp34 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 104ms VariablesStem: 16 VariablesLoop: 6 DisjunctsStem: 6 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...