./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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_35f45294-b8ea-4783-8943-d3c3d4e1a13b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_35f45294-b8ea-4783-8943-d3c3d4e1a13b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_35f45294-b8ea-4783-8943-d3c3d4e1a13b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_35f45294-b8ea-4783-8943-d3c3d4e1a13b/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_35f45294-b8ea-4783-8943-d3c3d4e1a13b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_35f45294-b8ea-4783-8943-d3c3d4e1a13b/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-aa41828 [2018-11-23 14:02:43,187 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:02:43,189 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:02:43,197 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:02:43,197 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:02:43,198 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:02:43,199 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:02:43,200 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:02:43,201 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:02:43,202 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:02:43,203 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:02:43,203 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:02:43,204 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:02:43,205 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:02:43,205 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:02:43,206 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:02:43,207 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:02:43,208 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:02:43,209 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:02:43,210 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:02:43,211 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:02:43,212 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:02:43,214 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:02:43,214 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:02:43,214 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:02:43,215 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:02:43,220 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:02:43,221 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:02:43,221 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:02:43,222 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:02:43,222 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:02:43,223 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:02:43,223 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:02:43,223 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:02:43,224 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:02:43,225 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:02:43,225 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_35f45294-b8ea-4783-8943-d3c3d4e1a13b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 14:02:43,235 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:02:43,236 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:02:43,237 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:02:43,237 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:02:43,237 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 14:02:43,237 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 14:02:43,237 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 14:02:43,237 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 14:02:43,238 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 14:02:43,238 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 14:02:43,238 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 14:02:43,238 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:02:43,238 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:02:43,238 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 14:02:43,239 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:02:43,239 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:02:43,239 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:02:43,239 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 14:02:43,239 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 14:02:43,239 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 14:02:43,239 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:02:43,240 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:02:43,240 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 14:02:43,240 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:02:43,240 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 14:02:43,240 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:02:43,240 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:02:43,241 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 14:02:43,241 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:02:43,241 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 14:02:43,241 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 14:02:43,242 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 14:02:43,242 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_35f45294-b8ea-4783-8943-d3c3d4e1a13b/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-11-23 14:02:43,268 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:02:43,278 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:02:43,281 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:02:43,283 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:02:43,283 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:02:43,284 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_35f45294-b8ea-4783-8943-d3c3d4e1a13b/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/avg_true-unreach-call_true-termination.i [2018-11-23 14:02:43,336 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_35f45294-b8ea-4783-8943-d3c3d4e1a13b/bin-2019/uautomizer/data/4d77ea094/1e4777ddb9fb43fbb5e343f9c8f811e6/FLAG42f604823 [2018-11-23 14:02:43,712 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:02:43,712 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_35f45294-b8ea-4783-8943-d3c3d4e1a13b/sv-benchmarks/c/reducercommutativity/avg_true-unreach-call_true-termination.i [2018-11-23 14:02:43,717 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_35f45294-b8ea-4783-8943-d3c3d4e1a13b/bin-2019/uautomizer/data/4d77ea094/1e4777ddb9fb43fbb5e343f9c8f811e6/FLAG42f604823 [2018-11-23 14:02:43,728 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_35f45294-b8ea-4783-8943-d3c3d4e1a13b/bin-2019/uautomizer/data/4d77ea094/1e4777ddb9fb43fbb5e343f9c8f811e6 [2018-11-23 14:02:43,731 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:02:43,732 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:02:43,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:02:43,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:02:43,736 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:02:43,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:02:43" (1/1) ... [2018-11-23 14:02:43,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45abf0fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:43, skipping insertion in model container [2018-11-23 14:02:43,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:02:43" (1/1) ... [2018-11-23 14:02:43,746 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:02:43,763 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:02:43,897 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:02:43,906 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:02:43,923 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:02:43,935 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:02:43,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:43 WrapperNode [2018-11-23 14:02:43,935 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:02:43,936 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:02:43,936 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:02:43,936 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:02:43,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:43" (1/1) ... [2018-11-23 14:02:43,950 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:43" (1/1) ... [2018-11-23 14:02:43,973 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:02:43,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:02:43,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:02:43,974 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:02:44,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:43" (1/1) ... [2018-11-23 14:02:44,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:43" (1/1) ... [2018-11-23 14:02:44,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:43" (1/1) ... [2018-11-23 14:02:44,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:43" (1/1) ... [2018-11-23 14:02:44,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:43" (1/1) ... [2018-11-23 14:02:44,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:43" (1/1) ... [2018-11-23 14:02:44,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:43" (1/1) ... [2018-11-23 14:02:44,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:02:44,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:02:44,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:02:44,043 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:02:44,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35f45294-b8ea-4783-8943-d3c3d4e1a13b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:02:44,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 14:02:44,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:02:44,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:02:44,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:02:44,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 14:02:44,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:02:44,300 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:02:44,300 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-23 14:02:44,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:02:44 BoogieIcfgContainer [2018-11-23 14:02:44,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:02:44,301 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 14:02:44,301 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 14:02:44,305 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 14:02:44,305 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 14:02:44,306 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:02:43" (1/3) ... [2018-11-23 14:02:44,306 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@bad06b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:02:44, skipping insertion in model container [2018-11-23 14:02:44,307 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 14:02:44,307 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:02:43" (2/3) ... [2018-11-23 14:02:44,307 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@bad06b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:02:44, skipping insertion in model container [2018-11-23 14:02:44,307 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 14:02:44,307 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:02:44" (3/3) ... [2018-11-23 14:02:44,309 INFO L375 chiAutomizerObserver]: Analyzing ICFG avg_true-unreach-call_true-termination.i [2018-11-23 14:02:44,352 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 14:02:44,352 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 14:02:44,352 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 14:02:44,352 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 14:02:44,352 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:02:44,353 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:02:44,353 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 14:02:44,353 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:02:44,353 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 14:02:44,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-23 14:02:44,382 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 14:02:44,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:02:44,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:02:44,387 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 14:02:44,387 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 14:02:44,387 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 14:02:44,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-23 14:02:44,388 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 14:02:44,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:02:44,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:02:44,389 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 14:02:44,389 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 14:02:44,394 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-11-23 14:02:44,395 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-11-23 14:02:44,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:02:44,401 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-11-23 14:02:44,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:02:44,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:02:44,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:44,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:02:44,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:02:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:02:44,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:02:44,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1379, now seen corresponding path program 1 times [2018-11-23 14:02:44,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:02:44,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:02:44,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:44,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:02:44,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:02:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:02:44,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:02:44,510 INFO L82 PathProgramCache]: Analyzing trace with hash 28693956, now seen corresponding path program 1 times [2018-11-23 14:02:44,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:02:44,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:02:44,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:44,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:02:44,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:02:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:02:44,713 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:02:44,714 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:02:44,714 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:02:44,715 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:02:44,715 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 14:02:44,715 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:02:44,715 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:02:44,715 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:02:44,715 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-23 14:02:44,715 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:02:44,716 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:02:44,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:44,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:44,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:44,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:44,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:44,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:44,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:44,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:44,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:44,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:44,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:44,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:44,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:44,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:44,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:44,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:44,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:44,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:44,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:44,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:44,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:45,125 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:02:45,128 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 14:02:45,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:45,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:45,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:02:45,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:45,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:45,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:45,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:02:45,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:02:45,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:45,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:45,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:45,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:02:45,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:45,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:45,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:45,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:02:45,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:02:45,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:45,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:45,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:45,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:02:45,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:45,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:45,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:45,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:02:45,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:02:45,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:45,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:45,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:45,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:02:45,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:45,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:45,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:45,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:02:45,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:02:45,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:45,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:45,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:45,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:02:45,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:45,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:45,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:45,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:02:45,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:02:45,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:45,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:45,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:45,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:45,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:45,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:45,155 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:02:45,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:02:45,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:45,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:45,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:45,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:02:45,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:45,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:45,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:45,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:02:45,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:02:45,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:45,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:45,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:45,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:02:45,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:45,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:45,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:45,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:02:45,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:02:45,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:45,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:45,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:45,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:02:45,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:45,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:45,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:45,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:02:45,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:02:45,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:45,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:45,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:45,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:02:45,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:45,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:45,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:45,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:02:45,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:02:45,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:45,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:45,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:45,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:02:45,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:45,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:45,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:45,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:02:45,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:02:45,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:45,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:45,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:45,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:45,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:45,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:45,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:02:45,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:02:45,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:45,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:45,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:45,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:02:45,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:45,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:45,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:45,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:02:45,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:02:45,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:45,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:45,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:45,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:02:45,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:45,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:45,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:45,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:02:45,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:02:45,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:45,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:45,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:45,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:02:45,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:45,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:45,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:45,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:02:45,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:02:45,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:45,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:45,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:45,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:02:45,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:45,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:45,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:45,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:02:45,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:02:45,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:45,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:45,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:45,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:02:45,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:45,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:45,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:45,196 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:02:45,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:02:45,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:45,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:45,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:45,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:02:45,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:45,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:45,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:45,199 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:02:45,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:02:45,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:45,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:45,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:45,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:02:45,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:45,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:45,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:45,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:02:45,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:02:45,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:45,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:45,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:45,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:02:45,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:45,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:45,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:45,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:02:45,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:02:45,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:45,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:45,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:45,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:45,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:45,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:45,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:02:45,211 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:02:45,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:45,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:45,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:45,219 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 14:02:45,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:45,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:45,221 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:02:45,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:02:45,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:45,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:45,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:45,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:45,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:45,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:45,241 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:02:45,241 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:02:45,273 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 14:02:45,308 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 14:02:45,309 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 14:02:45,311 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 14:02:45,312 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 14:02:45,313 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 14:02:45,313 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-11-23 14:02:45,324 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 14:02:45,330 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 14:02:45,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:02:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:02:45,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:02:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:02:45,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:02:45,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:02:45,404 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 14:02:45,405 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 3 states. [2018-11-23 14:02:45,452 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-11-23 14:02:45,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 14:02:45,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 14:02:45,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2018-11-23 14:02:45,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-23 14:02:45,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:02:45,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-23 14:02:45,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:02:45,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-23 14:02:45,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:02:45,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 69 transitions. [2018-11-23 14:02:45,462 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 14:02:45,465 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 17 states and 23 transitions. [2018-11-23 14:02:45,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-23 14:02:45,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-23 14:02:45,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2018-11-23 14:02:45,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 14:02:45,467 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-23 14:02:45,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2018-11-23 14:02:45,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 14:02:45,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 14:02:45,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-11-23 14:02:45,488 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-23 14:02:45,489 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-23 14:02:45,489 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 14:02:45,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2018-11-23 14:02:45,489 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 14:02:45,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:02:45,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:02:45,490 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 14:02:45,490 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 14:02:45,490 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-11-23 14:02:45,491 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-11-23 14:02:45,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:02:45,491 INFO L82 PathProgramCache]: Analyzing trace with hash 889510859, now seen corresponding path program 1 times [2018-11-23 14:02:45,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:02:45,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:02:45,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:45,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:02:45,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:45,496 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 14:02:45,497 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 14:02:45,497 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35f45294-b8ea-4783-8943-d3c3d4e1a13b/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-11-23 14:02:45,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:02:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:02:45,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:02:45,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:02:45,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:02:45,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:02:45,565 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 14:02:45,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:02:45,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2018-11-23 14:02:45,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:02:45,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:02:45,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:45,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:02:45,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:02:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:02:45,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:02:45,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:02:45,613 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-23 14:02:45,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:02:45,642 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-11-23 14:02:45,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:02:45,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2018-11-23 14:02:45,643 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 14:02:45,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2018-11-23 14:02:45,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-23 14:02:45,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-23 14:02:45,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-11-23 14:02:45,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 14:02:45,645 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-23 14:02:45,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-11-23 14:02:45,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-23 14:02:45,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 14:02:45,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-23 14:02:45,646 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-23 14:02:45,646 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-23 14:02:45,647 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 14:02:45,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-11-23 14:02:45,647 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 14:02:45,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:02:45,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:02:45,648 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:02:45,648 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 14:02:45,648 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-11-23 14:02:45,649 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-11-23 14:02:45,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:02:45,649 INFO L82 PathProgramCache]: Analyzing trace with hash 123162473, now seen corresponding path program 1 times [2018-11-23 14:02:45,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:02:45,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:02:45,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:45,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:02:45,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:45,654 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 14:02:45,654 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 14:02:45,654 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35f45294-b8ea-4783-8943-d3c3d4e1a13b/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-11-23 14:02:45,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:02:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:02:45,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:02:45,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:02:45,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 14:02:45,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-23 14:02:45,739 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 14:02:45,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:02:45,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 2 times [2018-11-23 14:02:45,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:02:45,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:02:45,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:45,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:02:45,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:02:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:02:45,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:02:45,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:02:45,778 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-23 14:02:45,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:02:45,868 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-11-23 14:02:45,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:02:45,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2018-11-23 14:02:45,868 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 14:02:45,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2018-11-23 14:02:45,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-23 14:02:45,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-23 14:02:45,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-11-23 14:02:45,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 14:02:45,869 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-23 14:02:45,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-11-23 14:02:45,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-23 14:02:45,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 14:02:45,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-11-23 14:02:45,871 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-23 14:02:45,871 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-23 14:02:45,871 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 14:02:45,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2018-11-23 14:02:45,871 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 14:02:45,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:02:45,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:02:45,872 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-23 14:02:45,872 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 14:02:45,872 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-11-23 14:02:45,873 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-11-23 14:02:45,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:02:45,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1898228857, now seen corresponding path program 2 times [2018-11-23 14:02:45,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:02:45,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:02:45,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:45,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:02:45,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:45,879 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 14:02:45,879 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 14:02:45,879 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35f45294-b8ea-4783-8943-d3c3d4e1a13b/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-11-23 14:02:45,891 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 14:02:45,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 14:02:45,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-23 14:02:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:02:45,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:02:45,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 3 times [2018-11-23 14:02:45,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:02:45,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:02:45,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:45,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:02:45,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:02:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:02:45,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:02:45,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1163170153, now seen corresponding path program 1 times [2018-11-23 14:02:45,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:02:45,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:02:45,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:45,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:02:45,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:45,965 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 14:02:45,965 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 14:02:45,965 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35f45294-b8ea-4783-8943-d3c3d4e1a13b/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-11-23 14:02:45,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:02:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:02:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:02:46,523 WARN L180 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 114 [2018-11-23 14:02:48,715 WARN L180 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2018-11-23 14:02:48,717 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:02:48,717 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:02:48,717 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:02:48,717 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:02:48,717 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 14:02:48,718 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:02:48,718 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:02:48,718 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:02:48,718 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg_true-unreach-call_true-termination.i_Iteration4_Lasso [2018-11-23 14:02:48,718 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:02:48,718 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:02:48,721 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 14:02:48,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:48,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:48,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:48,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:48,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:48,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:48,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:48,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:48,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:48,813 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 29 [2018-11-23 14:02:49,609 WARN L180 SmtUtils]: Spent 745.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2018-11-23 14:02:49,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:49,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:49,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:49,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:49,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:49,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:49,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:49,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:49,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:49,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:02:49,637 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 14:02:50,314 WARN L180 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 94 [2018-11-23 14:02:50,335 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 14:02:51,599 WARN L180 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2018-11-23 14:02:51,618 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:02:51,619 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 14:02:51,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:51,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:51,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:02:51,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:51,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:51,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:51,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:02:51,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:02:51,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:51,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:51,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:51,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:02:51,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:51,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:51,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:51,623 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:02:51,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:02:51,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:51,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:51,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:51,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:02:51,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:51,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:51,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:51,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:02:51,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:02:51,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:51,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:51,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:51,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:02:51,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:51,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:51,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:51,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:02:51,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:02:51,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:51,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:51,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:51,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:51,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:51,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:51,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:02:51,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:02:51,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:51,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:51,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:51,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:02:51,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:51,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:51,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:51,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:02:51,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:02:51,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:51,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:51,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:51,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:02:51,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:51,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:51,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:51,633 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:02:51,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:02:51,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:51,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:51,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:51,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:02:51,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:51,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:51,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:51,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:02:51,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:02:51,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:51,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:51,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:51,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:02:51,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:51,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:51,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:51,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:02:51,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:02:51,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:51,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:51,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:51,639 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 14:02:51,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:51,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:51,641 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 14:02:51,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:02:51,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:51,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:51,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:51,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:51,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:51,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:51,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:02:51,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:02:51,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:51,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:51,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:51,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:51,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:51,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:51,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:02:51,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:02:51,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:51,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:51,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:51,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:02:51,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:51,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:51,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:02:51,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:02:51,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:02:51,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:02:51,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:02:51,670 INFO L205 nArgumentSynthesizer]: 6 stem disjuncts [2018-11-23 14:02:51,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:02:51,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:02:51,675 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-23 14:02:51,676 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:02:51,742 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 14:02:51,796 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-23 14:02:51,796 INFO L444 ModelExtractionUtils]: 21 out of 31 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-23 14:02:51,796 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 14:02:51,797 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 14:02:51,798 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 14:02:51,798 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)_2) = -1*ULTIMATE.start_avg_~x.offset - 4*ULTIMATE.start_avg_~i~0 + 1*v_rep(select #length ULTIMATE.start_avg_~x.base)_2 Supporting invariants [] [2018-11-23 14:02:51,821 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-23 14:02:51,824 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 14:02:51,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:02:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:02:51,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:02:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:02:51,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:02:51,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:02:51,860 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 14:02:51,860 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-23 14:02:51,879 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-11-23 14:02:51,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 14:02:51,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 14:02:51,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-23 14:02:51,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-23 14:02:51,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:02:51,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-23 14:02:51,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:02:51,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-23 14:02:51,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:02:51,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2018-11-23 14:02:51,882 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 14:02:51,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 24 transitions. [2018-11-23 14:02:51,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 14:02:51,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-23 14:02:51,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2018-11-23 14:02:51,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 14:02:51,883 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-11-23 14:02:51,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2018-11-23 14:02:51,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 14:02:51,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 14:02:51,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2018-11-23 14:02:51,885 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-11-23 14:02:51,885 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-11-23 14:02:51,885 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 14:02:51,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2018-11-23 14:02:51,886 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 14:02:51,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:02:51,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:02:51,887 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:02:51,887 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 14:02:51,887 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-11-23 14:02:51,887 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-11-23 14:02:51,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:02:51,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1698534614, now seen corresponding path program 1 times [2018-11-23 14:02:51,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:02:51,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:02:51,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:51,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:02:51,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:51,893 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 14:02:51,893 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 14:02:51,893 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35f45294-b8ea-4783-8943-d3c3d4e1a13b/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-11-23 14:02:51,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:02:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:02:51,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:02:51,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 14:02:51,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:02:51,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:02:51,973 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 14:02:51,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:02:51,973 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 1 times [2018-11-23 14:02:51,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:02:51,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:02:51,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:51,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:02:51,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:02:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:02:52,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:02:52,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:02:52,013 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-23 14:02:52,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:02:52,054 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-23 14:02:52,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:02:52,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2018-11-23 14:02:52,055 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 14:02:52,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 24 transitions. [2018-11-23 14:02:52,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-23 14:02:52,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-23 14:02:52,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 24 transitions. [2018-11-23 14:02:52,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 14:02:52,056 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-23 14:02:52,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 24 transitions. [2018-11-23 14:02:52,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-11-23 14:02:52,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 14:02:52,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-23 14:02:52,058 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-23 14:02:52,058 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-23 14:02:52,058 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 14:02:52,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-11-23 14:02:52,058 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 14:02:52,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:02:52,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:02:52,059 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:02:52,059 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 14:02:52,059 INFO L794 eck$LassoCheckResult]: Stem: 470#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 469#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; 468#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; 462#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; 463#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 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; 467#L11-3 assume !(avg_~i~0 < ~N~0); 458#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); 459#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; 473#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; 474#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 475#L11-8 assume !(avg_~i~0 < ~N~0); 471#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); 472#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; 460#L32-3 [2018-11-23 14:02:52,059 INFO L796 eck$LassoCheckResult]: Loop: 460#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; 461#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 460#L32-3 [2018-11-23 14:02:52,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:02:52,059 INFO L82 PathProgramCache]: Analyzing trace with hash 205910964, now seen corresponding path program 1 times [2018-11-23 14:02:52,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:02:52,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:02:52,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:52,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:02:52,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:52,068 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 14:02:52,068 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 14:02:52,069 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35f45294-b8ea-4783-8943-d3c3d4e1a13b/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-11-23 14:02:52,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:02:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:02:52,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:02:52,120 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 14:02:52,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 14:02:52,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 14:02:52,138 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 14:02:52,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:02:52,139 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 2 times [2018-11-23 14:02:52,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:02:52,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:02:52,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:52,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:02:52,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:02:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:02:52,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 14:02:52,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 14:02:52,177 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-23 14:02:52,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:02:52,235 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 14:02:52,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 14:02:52,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 27 transitions. [2018-11-23 14:02:52,237 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 14:02:52,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 27 transitions. [2018-11-23 14:02:52,237 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-23 14:02:52,237 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-23 14:02:52,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2018-11-23 14:02:52,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 14:02:52,238 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 14:02:52,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2018-11-23 14:02:52,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-11-23 14:02:52,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 14:02:52,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-23 14:02:52,240 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-23 14:02:52,240 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-23 14:02:52,240 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 14:02:52,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2018-11-23 14:02:52,240 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 14:02:52,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:02:52,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:02:52,241 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:02:52,241 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 14:02:52,241 INFO L794 eck$LassoCheckResult]: Stem: 563#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 562#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; 561#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; 556#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; 557#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 558#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; 559#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 570#L11-3 assume !(avg_~i~0 < ~N~0); 552#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); 553#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; 566#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; 567#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 568#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; 569#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 571#L11-8 assume !(avg_~i~0 < ~N~0); 564#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); 565#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; 554#L32-3 [2018-11-23 14:02:52,241 INFO L796 eck$LassoCheckResult]: Loop: 554#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; 555#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 554#L32-3 [2018-11-23 14:02:52,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:02:52,242 INFO L82 PathProgramCache]: Analyzing trace with hash 313660178, now seen corresponding path program 2 times [2018-11-23 14:02:52,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:02:52,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:02:52,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:52,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:02:52,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:52,246 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 14:02:52,247 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 14:02:52,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35f45294-b8ea-4783-8943-d3c3d4e1a13b/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-11-23 14:02:52,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 14:02:52,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 14:02:52,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-23 14:02:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:02:52,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:02:52,327 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 3 times [2018-11-23 14:02:52,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:02:52,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:02:52,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:52,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:02:52,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:02:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:02:52,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:02:52,338 INFO L82 PathProgramCache]: Analyzing trace with hash 779721780, now seen corresponding path program 1 times [2018-11-23 14:02:52,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:02:52,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:02:52,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:52,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:02:52,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:02:52,343 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 14:02:52,343 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 14:02:52,343 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35f45294-b8ea-4783-8943-d3c3d4e1a13b/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-11-23 14:02:52,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:02:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:02:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:02:53,401 WARN L180 SmtUtils]: Spent 916.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 156 [2018-11-23 14:03:05,695 WARN L180 SmtUtils]: Spent 11.59 s on a formula simplification. DAG size of input: 415 DAG size of output: 111 [2018-11-23 14:03:05,697 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:03:05,698 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:03:05,698 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:03:05,698 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:03:05,698 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 14:03:05,698 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:03:05,698 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:03:05,698 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:03:05,698 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg_true-unreach-call_true-termination.i_Iteration7_Lasso [2018-11-23 14:03:05,698 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:03:05,699 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:03:05,701 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 14:03:05,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:05,947 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 110 [2018-11-23 14:03:09,755 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 5096 conjuctions. This might take some time... [2018-11-23 14:03:09,787 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 6 conjuctions. [2018-11-23 14:03:11,151 WARN L180 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 108 DAG size of output: 97 [2018-11-23 14:03:11,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:11,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:11,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:11,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:03:11,199 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 14:03:15,808 WARN L180 SmtUtils]: Spent 4.49 s on a formula simplification. DAG size of input: 299 DAG size of output: 164 [2018-11-23 14:03:15,840 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2018-11-23 14:03:31,850 WARN L180 SmtUtils]: Spent 15.96 s on a formula simplification. DAG size of input: 203 DAG size of output: 148 [2018-11-23 14:03:31,891 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:03:31,891 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 14:03:31,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:31,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:31,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:03:31,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:31,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:31,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:31,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:03:31,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:03:31,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:03:31,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:31,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:31,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:03:31,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:31,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:31,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:31,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:03:31,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:03:31,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:03:31,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:31,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:31,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:31,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:31,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:31,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:03:31,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:03:31,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:03:31,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:31,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:31,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:03:31,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:31,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:31,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:31,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:03:31,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:03:31,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:03:31,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:31,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:31,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:03:31,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:31,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:31,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:31,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:03:31,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:03:31,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:03:31,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:31,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:31,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:03:31,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:31,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:31,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:31,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:03:31,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:03:31,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:03:31,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:31,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:31,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:03:31,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:31,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:31,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:31,915 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:03:31,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:03:31,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:03:31,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:31,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:31,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:31,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:31,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:31,919 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:03:31,919 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:03:31,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:03:31,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:31,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:31,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:03:31,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:31,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:31,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:31,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:03:31,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:03:31,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:03:31,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:31,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:31,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:03:31,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:31,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:31,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:31,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:03:31,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:03:31,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:03:31,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:31,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:31,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:03:31,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:31,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:31,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:31,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:03:31,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:03:31,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:03:31,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:31,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:31,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:03:31,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:31,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:31,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:03:31,929 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:03:31,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:03:31,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:03:31,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:03:31,934 INFO L205 nArgumentSynthesizer]: 6 stem disjuncts [2018-11-23 14:03:31,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:03:31,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:03:31,949 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-23 14:03:31,949 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:03:32,016 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 14:03:32,123 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2018-11-23 14:03:32,123 INFO L444 ModelExtractionUtils]: 51 out of 61 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-23 14:03:32,123 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 14:03:32,124 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 14:03:32,125 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 14:03:32,125 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-11-23 14:03:32,180 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-23 14:03:32,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:03:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:03:32,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:03:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:03:32,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:03:32,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:03:32,227 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 14:03:32,227 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-23 14:03:32,263 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-11-23 14:03:32,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 14:03:32,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 14:03:32,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-23 14:03:32,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 2 letters. [2018-11-23 14:03:32,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:03:32,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 19 letters. Loop has 2 letters. [2018-11-23 14:03:32,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:03:32,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 4 letters. [2018-11-23 14:03:32,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:03:32,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2018-11-23 14:03:32,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 14:03:32,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 27 transitions. [2018-11-23 14:03:32,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-23 14:03:32,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 14:03:32,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2018-11-23 14:03:32,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 14:03:32,272 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-23 14:03:32,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2018-11-23 14:03:32,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 14:03:32,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 14:03:32,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-23 14:03:32,274 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-23 14:03:32,274 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-23 14:03:32,274 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 14:03:32,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-11-23 14:03:32,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 14:03:32,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:03:32,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:03:32,275 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:03:32,275 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 14:03:32,275 INFO L794 eck$LassoCheckResult]: Stem: 729#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 728#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; 727#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; 722#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; 723#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 724#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; 725#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 736#L11-3 assume !(avg_~i~0 < ~N~0); 717#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); 718#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; 732#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; 733#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 734#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; 735#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 737#L11-8 assume !(avg_~i~0 < ~N~0); 730#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); 731#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; 719#L32-3 assume !(main_~i~1 < ~N~0 - 1); 715#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; 716#L11-13 [2018-11-23 14:03:32,275 INFO L796 eck$LassoCheckResult]: Loop: 716#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; 726#L11-12 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 716#L11-13 [2018-11-23 14:03:32,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:03:32,276 INFO L82 PathProgramCache]: Analyzing trace with hash 779721722, now seen corresponding path program 1 times [2018-11-23 14:03:32,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:03:32,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:03:32,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:03:32,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:03:32,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:03:32,280 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 14:03:32,280 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 14:03:32,280 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35f45294-b8ea-4783-8943-d3c3d4e1a13b/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-11-23 14:03:32,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:03:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:03:32,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:03:32,346 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 14:03:32,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:03:32,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:03:32,374 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 14:03:32,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:03:32,375 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 1 times [2018-11-23 14:03:32,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:03:32,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:03:32,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:03:32,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:03:32,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:03:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:03:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:03:32,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:03:32,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:03:32,443 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-23 14:03:32,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:03:32,500 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 14:03:32,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:03:32,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 27 transitions. [2018-11-23 14:03:32,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 14:03:32,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 27 transitions. [2018-11-23 14:03:32,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 14:03:32,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 14:03:32,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2018-11-23 14:03:32,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 14:03:32,502 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 14:03:32,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2018-11-23 14:03:32,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 14:03:32,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 14:03:32,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-11-23 14:03:32,504 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-23 14:03:32,504 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-23 14:03:32,504 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 14:03:32,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2018-11-23 14:03:32,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 14:03:32,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 14:03:32,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 14:03:32,505 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:03:32,505 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 14:03:32,505 INFO L794 eck$LassoCheckResult]: Stem: 837#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 836#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; 835#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; 830#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; 831#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 832#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; 833#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 844#L11-3 assume !(avg_~i~0 < ~N~0); 825#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); 826#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; 840#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; 841#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 842#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; 843#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 845#L11-8 assume !(avg_~i~0 < ~N~0); 838#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); 839#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; 827#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; 828#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 829#L32-3 assume !(main_~i~1 < ~N~0 - 1); 823#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; 824#L11-13 [2018-11-23 14:03:32,505 INFO L796 eck$LassoCheckResult]: Loop: 824#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; 834#L11-12 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 824#L11-13 [2018-11-23 14:03:32,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:03:32,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1988322460, now seen corresponding path program 1 times [2018-11-23 14:03:32,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:03:32,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:03:32,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:03:32,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:03:32,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:03:32,509 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 14:03:32,510 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 14:03:32,510 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35f45294-b8ea-4783-8943-d3c3d4e1a13b/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-11-23 14:03:32,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:03:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:03:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:03:32,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:03:32,640 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 2 times [2018-11-23 14:03:32,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:03:32,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:03:32,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:03:32,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:03:32,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:03:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:03:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:03:32,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:03:32,650 INFO L82 PathProgramCache]: Analyzing trace with hash -482560770, now seen corresponding path program 1 times [2018-11-23 14:03:32,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:03:32,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:03:32,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:03:32,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:03:32,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:03:32,657 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 14:03:32,657 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 14:03:32,657 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_35f45294-b8ea-4783-8943-d3c3d4e1a13b/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-11-23 14:03:32,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:03:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:03:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:03:41,205 WARN L180 SmtUtils]: Spent 8.40 s on a formula simplification. DAG size of input: 229 DAG size of output: 191 [2018-11-23 14:04:01,337 WARN L180 SmtUtils]: Spent 19.89 s on a formula simplification. DAG size of input: 230 DAG size of output: 116 [2018-11-23 14:04:01,340 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 14:04:01,340 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 14:04:01,340 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 14:04:01,340 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 14:04:01,340 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 14:04:01,340 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 14:04:01,340 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 14:04:01,340 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 14:04:01,340 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg_true-unreach-call_true-termination.i_Iteration9_Lasso [2018-11-23 14:04:01,340 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 14:04:01,341 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 14:04:01,343 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 14:04:01,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:01,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:01,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:01,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:01,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:01,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:01,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:01,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:01,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:01,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:01,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:01,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:01,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:01,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:01,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:01,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:01,519 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 109 [2018-11-23 14:04:03,874 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 5323 conjuctions. This might take some time... [2018-11-23 14:04:03,930 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 10 conjuctions. [2018-11-23 14:04:05,201 WARN L180 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 102 DAG size of output: 85 [2018-11-23 14:04:05,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:05,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 14:04:05,219 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 14:04:06,725 WARN L180 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 234 DAG size of output: 118 [2018-11-23 14:04:06,756 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-23 14:04:09,526 WARN L180 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 213 DAG size of output: 102 [2018-11-23 14:04:09,564 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 14:04:09,564 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 14:04:09,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:09,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:09,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:04:09,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:04:09,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:09,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:09,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:04:09,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:04:09,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:04:09,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:09,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:09,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:04:09,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:04:09,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:09,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:09,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:04:09,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:04:09,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:04:09,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:09,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:09,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:04:09,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:04:09,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:09,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:09,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:04:09,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:04:09,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:04:09,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:09,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:09,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:04:09,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:09,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:09,578 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:04:09,578 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:04:09,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:04:09,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:09,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:09,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:04:09,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:04:09,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:09,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:09,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:04:09,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:04:09,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:04:09,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:09,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:09,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:04:09,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:09,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:09,583 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:04:09,583 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:04:09,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:04:09,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:09,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:09,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:04:09,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:04:09,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:09,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:09,586 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:04:09,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:04:09,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:04:09,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:09,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:09,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:04:09,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:09,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:09,588 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 14:04:09,588 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:04:09,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:04:09,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:09,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:09,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:04:09,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:04:09,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:09,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:09,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:04:09,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:04:09,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:04:09,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:09,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:09,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:04:09,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:04:09,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:09,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:09,592 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:04:09,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:04:09,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:04:09,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:09,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:09,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:04:09,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:04:09,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:09,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:09,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:04:09,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:04:09,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:04:09,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:09,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:09,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:04:09,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:04:09,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:09,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:09,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:04:09,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:04:09,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:04:09,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:09,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:09,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:04:09,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:04:09,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:09,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:09,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:04:09,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:04:09,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:04:09,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:09,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:09,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:04:09,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:04:09,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:09,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:09,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:04:09,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:04:09,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:04:09,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:09,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:09,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 14:04:09,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 14:04:09,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:09,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:09,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 14:04:09,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 14:04:09,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 14:04:09,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 14:04:09,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 14:04:09,602 INFO L205 nArgumentSynthesizer]: 6 stem disjuncts [2018-11-23 14:04:09,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 14:04:09,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 14:04:09,607 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-23 14:04:09,608 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 14:04:09,650 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 14:04:09,685 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 14:04:09,685 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 14:04:09,686 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 14:04:09,686 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 14:04:09,687 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 14:04:09,687 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-11-23 14:04:09,729 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-23 14:04:09,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:04:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:04:09,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:04:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:04:09,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:04:09,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:04:09,790 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 14:04:09,790 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-23 14:04:09,802 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-11-23 14:04:09,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 14:04:09,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 14:04:09,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-23 14:04:09,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 21 letters. Loop has 2 letters. [2018-11-23 14:04:09,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:04:09,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 23 letters. Loop has 2 letters. [2018-11-23 14:04:09,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:04:09,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 21 letters. Loop has 4 letters. [2018-11-23 14:04:09,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 14:04:09,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2018-11-23 14:04:09,805 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 14:04:09,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2018-11-23 14:04:09,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 14:04:09,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 14:04:09,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 14:04:09,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 14:04:09,806 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 14:04:09,806 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 14:04:09,806 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 14:04:09,806 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 14:04:09,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 14:04:09,807 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 14:04:09,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 14:04:09,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 02:04:09 BoogieIcfgContainer [2018-11-23 14:04:09,814 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 14:04:09,814 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:04:09,814 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:04:09,814 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:04:09,815 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:02:44" (3/4) ... [2018-11-23 14:04:09,818 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 14:04:09,818 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:04:09,819 INFO L168 Benchmark]: Toolchain (without parser) took 86087.40 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 959.1 MB in the beginning and 1.9 GB in the end (delta: -926.9 MB). Peak memory consumption was 891.8 MB. Max. memory is 11.5 GB. [2018-11-23 14:04:09,820 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:04:09,820 INFO L168 Benchmark]: CACSL2BoogieTranslator took 202.78 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:04:09,820 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.41 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:04:09,821 INFO L168 Benchmark]: Boogie Preprocessor took 68.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -189.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:04:09,821 INFO L168 Benchmark]: RCFGBuilder took 258.23 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:04:09,822 INFO L168 Benchmark]: BuchiAutomizer took 85512.49 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -770.9 MB). Peak memory consumption was 907.3 MB. Max. memory is 11.5 GB. [2018-11-23 14:04:09,822 INFO L168 Benchmark]: Witness Printer took 4.20 ms. Allocated memory is still 2.8 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:04:09,825 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 202.78 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 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 37.41 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -189.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 258.23 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 85512.49 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -770.9 MB). Peak memory consumption was 907.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.20 ms. Allocated memory is still 2.8 GB. Free memory is still 1.9 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 + -4 * i + unknown-#length-unknown[x] 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 85.4s and 10 iterations. TraceHistogramMax:2. Analysis of lassos took 84.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 6 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: 114 SDtfs, 81 SDslu, 28 SDs, 0 SdLazy, 169 SolverSat, 18 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU5 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital1039 mio100 ax100 hnf99 lsp452 ukn32 mio100 lsp369 div63 bol100 ite100 ukn100 eq168 hnf93 smp43 dnf1826 smp34 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 128ms 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...