./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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_dff998f4-c0c1-4f1c-8f0b-65f2a625fbf4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_dff998f4-c0c1-4f1c-8f0b-65f2a625fbf4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_dff998f4-c0c1-4f1c-8f0b-65f2a625fbf4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_dff998f4-c0c1-4f1c-8f0b-65f2a625fbf4/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_dff998f4-c0c1-4f1c-8f0b-65f2a625fbf4/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_dff998f4-c0c1-4f1c-8f0b-65f2a625fbf4/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-0cd3be1 [2018-11-28 13:36:35,066 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:36:35,067 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:36:35,075 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:36:35,075 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:36:35,076 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:36:35,077 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:36:35,078 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:36:35,079 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:36:35,079 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:36:35,080 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:36:35,080 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:36:35,081 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:36:35,081 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:36:35,082 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:36:35,082 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:36:35,083 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:36:35,084 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:36:35,085 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:36:35,086 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:36:35,087 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:36:35,088 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:36:35,089 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:36:35,089 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:36:35,090 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:36:35,090 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:36:35,091 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:36:35,091 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:36:35,092 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:36:35,093 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:36:35,093 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:36:35,093 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:36:35,093 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:36:35,093 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:36:35,094 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:36:35,095 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:36:35,095 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_dff998f4-c0c1-4f1c-8f0b-65f2a625fbf4/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 13:36:35,105 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:36:35,105 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:36:35,106 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:36:35,106 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:36:35,106 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:36:35,107 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 13:36:35,107 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 13:36:35,107 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 13:36:35,107 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 13:36:35,107 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 13:36:35,107 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 13:36:35,108 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:36:35,108 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:36:35,108 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 13:36:35,108 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:36:35,108 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:36:35,108 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:36:35,108 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 13:36:35,108 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 13:36:35,109 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 13:36:35,110 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:36:35,110 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:36:35,110 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 13:36:35,110 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:36:35,110 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 13:36:35,111 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:36:35,111 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:36:35,111 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 13:36:35,111 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:36:35,111 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:36:35,111 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 13:36:35,112 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 13:36:35,112 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_dff998f4-c0c1-4f1c-8f0b-65f2a625fbf4/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-28 13:36:35,135 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:36:35,143 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:36:35,146 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:36:35,147 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:36:35,147 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:36:35,148 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_dff998f4-c0c1-4f1c-8f0b-65f2a625fbf4/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/avg_true-unreach-call_true-termination.i [2018-11-28 13:36:35,187 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dff998f4-c0c1-4f1c-8f0b-65f2a625fbf4/bin-2019/uautomizer/data/c3e985738/b646dda1678a4125b18acb490469ead2/FLAG163f66b6a [2018-11-28 13:36:35,571 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:36:35,571 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_dff998f4-c0c1-4f1c-8f0b-65f2a625fbf4/sv-benchmarks/c/reducercommutativity/avg_true-unreach-call_true-termination.i [2018-11-28 13:36:35,574 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dff998f4-c0c1-4f1c-8f0b-65f2a625fbf4/bin-2019/uautomizer/data/c3e985738/b646dda1678a4125b18acb490469ead2/FLAG163f66b6a [2018-11-28 13:36:35,583 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_dff998f4-c0c1-4f1c-8f0b-65f2a625fbf4/bin-2019/uautomizer/data/c3e985738/b646dda1678a4125b18acb490469ead2 [2018-11-28 13:36:35,585 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:36:35,586 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:36:35,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:36:35,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:36:35,589 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:36:35,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:36:35" (1/1) ... [2018-11-28 13:36:35,590 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fad3104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:36:35, skipping insertion in model container [2018-11-28 13:36:35,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:36:35" (1/1) ... [2018-11-28 13:36:35,595 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:36:35,605 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:36:35,707 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:36:35,712 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:36:35,724 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:36:35,733 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:36:35,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:36:35 WrapperNode [2018-11-28 13:36:35,733 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:36:35,733 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:36:35,733 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:36:35,734 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:36:35,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:36:35" (1/1) ... [2018-11-28 13:36:35,744 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:36:35" (1/1) ... [2018-11-28 13:36:35,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:36:35,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:36:35,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:36:35,799 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:36:35,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:36:35" (1/1) ... [2018-11-28 13:36:35,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:36:35" (1/1) ... [2018-11-28 13:36:35,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:36:35" (1/1) ... [2018-11-28 13:36:35,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:36:35" (1/1) ... [2018-11-28 13:36:35,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:36:35" (1/1) ... [2018-11-28 13:36:35,817 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:36:35" (1/1) ... [2018-11-28 13:36:35,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:36:35" (1/1) ... [2018-11-28 13:36:35,821 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:36:35,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:36:35,821 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:36:35,821 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:36:35,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:36:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dff998f4-c0c1-4f1c-8f0b-65f2a625fbf4/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-28 13:36:35,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:36:35,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:36:35,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:36:35,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:36:35,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 13:36:35,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:36:36,069 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:36:36,069 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-28 13:36:36,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:36:36 BoogieIcfgContainer [2018-11-28 13:36:36,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:36:36,070 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 13:36:36,070 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 13:36:36,072 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 13:36:36,073 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:36:36,073 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 01:36:35" (1/3) ... [2018-11-28 13:36:36,074 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5501e490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:36:36, skipping insertion in model container [2018-11-28 13:36:36,074 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:36:36,074 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:36:35" (2/3) ... [2018-11-28 13:36:36,074 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5501e490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:36:36, skipping insertion in model container [2018-11-28 13:36:36,074 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:36:36,074 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:36:36" (3/3) ... [2018-11-28 13:36:36,075 INFO L375 chiAutomizerObserver]: Analyzing ICFG avg_true-unreach-call_true-termination.i [2018-11-28 13:36:36,111 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:36:36,111 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 13:36:36,111 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 13:36:36,111 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 13:36:36,111 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:36:36,111 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:36:36,111 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 13:36:36,112 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:36:36,112 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 13:36:36,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-28 13:36:36,136 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-28 13:36:36,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:36:36,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:36:36,140 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 13:36:36,140 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:36:36,140 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 13:36:36,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-28 13:36:36,141 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-28 13:36:36,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:36:36,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:36:36,142 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 13:36:36,142 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:36:36,148 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-28 13:36:36,148 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-28 13:36:36,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:36:36,153 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-11-28 13:36:36,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:36:36,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:36:36,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:36,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:36:36,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:36:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:36:36,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:36:36,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1379, now seen corresponding path program 1 times [2018-11-28 13:36:36,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:36:36,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:36:36,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:36,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:36:36,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:36:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:36:36,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:36:36,246 INFO L82 PathProgramCache]: Analyzing trace with hash 28693956, now seen corresponding path program 1 times [2018-11-28 13:36:36,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:36:36,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:36:36,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:36,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:36:36,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:36:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:36:36,416 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:36:36,417 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:36:36,417 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:36:36,417 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:36:36,417 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:36:36,417 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:36:36,417 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:36:36,418 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:36:36,418 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-28 13:36:36,418 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:36:36,418 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:36:36,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:36:36,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-28 13:36:36,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-28 13:36:36,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-28 13:36:36,448 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-28 13:36:36,450 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-28 13:36:36,458 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-28 13:36:36,460 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-28 13:36:36,462 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-28 13:36:36,464 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-28 13:36:36,466 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-28 13:36:36,468 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-28 13:36:36,470 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-28 13:36:36,471 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-28 13:36:36,472 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-28 13:36:36,473 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-28 13:36:36,479 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-28 13:36:36,481 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-28 13:36:36,483 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-28 13:36:36,485 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-28 13:36:36,487 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-28 13:36:36,754 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:36:36,757 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:36:36,759 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-28 13:36:36,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:36,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:36:36,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:36,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:36,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:36,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:36:36,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:36:36,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:36,766 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-28 13:36:36,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:36,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:36:36,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:36,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:36,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:36,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:36:36,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:36:36,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:36,768 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-28 13:36:36,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:36,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:36:36,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:36,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:36,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:36,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:36:36,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:36:36,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:36,774 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-28 13:36:36,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:36,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:36:36,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:36,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:36,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:36,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:36:36,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:36:36,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:36,777 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-28 13:36:36,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:36,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:36:36,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:36,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:36,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:36,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:36:36,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:36:36,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:36,781 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-28 13:36:36,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:36,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:36,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:36,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:36,784 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:36:36,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:36:36,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:36,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:36:36,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:36,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:36:36,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:36,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:36,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:36,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:36:36,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:36:36,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:36,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:36:36,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:36,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:36:36,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:36,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:36,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:36,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:36:36,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:36:36,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:36,794 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-28 13:36:36,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:36,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:36:36,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:36,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:36,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:36,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:36:36,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:36:36,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:36,800 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-28 13:36:36,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:36,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:36:36,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:36,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:36,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:36,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:36:36,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:36:36,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:36,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:36:36,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:36,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:36:36,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:36,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:36,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:36,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:36:36,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:36:36,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:36,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:36:36,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:36,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:36,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:36,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:36,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:36:36,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:36:36,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:36,815 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-28 13:36:36,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:36,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:36:36,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:36,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:36,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:36,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:36:36,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:36:36,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:36,818 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-28 13:36:36,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:36,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:36:36,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:36,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:36,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:36,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:36:36,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:36:36,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:36,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:36:36,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:36,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:36:36,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:36,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:36,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:36,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:36:36,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:36:36,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:36,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:36:36,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:36,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:36:36,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:36,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:36,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:36,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:36:36,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:36:36,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:36,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:36:36,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:36,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:36:36,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:36,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:36,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:36,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:36:36,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:36:36,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:36,833 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-28 13:36:36,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:36,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:36:36,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:36,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:36,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:36,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:36:36,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:36:36,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:36,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:36:36,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:36,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:36:36,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:36,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:36,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:36,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:36:36,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:36:36,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:36,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:36:36,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:36,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:36:36,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:36,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:36,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:36,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:36:36,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:36:36,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:36,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:36:36,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:36,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:36,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:36,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:36,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:36:36,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:36:36,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:36,852 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-28 13:36:36,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:36,852 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:36:36,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:36,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:36,854 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:36:36,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:36:36,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:36,866 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-28 13:36:36,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:36,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:36,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:36,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:36,869 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:36:36,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:36:36,897 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:36:36,929 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 13:36:36,929 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 13:36:36,932 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:36:36,933 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:36:36,933 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:36:36,934 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_avg_~x.offset, v_rep(select #length ULTIMATE.start_avg_~x.base)_1, ULTIMATE.start_avg_~i~0) = -1*ULTIMATE.start_avg_~x.offset + 1*v_rep(select #length ULTIMATE.start_avg_~x.base)_1 - 4*ULTIMATE.start_avg_~i~0 Supporting invariants [] [2018-11-28 13:36:36,949 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 13:36:36,955 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 13:36:36,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:36:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:36:36,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:36:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:36:36,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:36:37,011 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-28 13:36:37,022 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-28 13:36:37,023 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 3 states. [2018-11-28 13:36:37,063 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-28 13:36:37,063 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-28 13:36:37,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:36:37,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2018-11-28 13:36:37,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-28 13:36:37,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:36:37,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 13:36:37,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:36:37,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-28 13:36:37,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:36:37,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 69 transitions. [2018-11-28 13:36:37,073 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-28 13:36:37,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 17 states and 23 transitions. [2018-11-28 13:36:37,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 13:36:37,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 13:36:37,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2018-11-28 13:36:37,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:36:37,079 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-28 13:36:37,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2018-11-28 13:36:37,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-28 13:36:37,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 13:36:37,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-11-28 13:36:37,095 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-28 13:36:37,095 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-28 13:36:37,096 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 13:36:37,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2018-11-28 13:36:37,096 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-28 13:36:37,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:36:37,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:36:37,097 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 13:36:37,097 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:36:37,097 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-28 13:36:37,097 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-28 13:36:37,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:36:37,098 INFO L82 PathProgramCache]: Analyzing trace with hash 889510859, now seen corresponding path program 1 times [2018-11-28 13:36:37,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:36:37,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:36:37,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:37,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:36:37,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:37,103 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 13:36:37,103 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 13:36:37,103 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dff998f4-c0c1-4f1c-8f0b-65f2a625fbf4/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-28 13:36:37,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:36:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:36:37,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:36:37,139 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-28 13:36:37,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:36:37,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:36:37,155 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:36:37,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:36:37,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2018-11-28 13:36:37,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:36:37,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:36:37,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:37,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:36:37,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:36:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:36:37,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:36:37,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:36:37,201 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-28 13:36:37,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:36:37,220 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-11-28 13:36:37,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:36:37,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2018-11-28 13:36:37,222 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-28 13:36:37,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2018-11-28 13:36:37,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-28 13:36:37,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 13:36:37,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-11-28 13:36:37,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:36:37,224 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-28 13:36:37,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-11-28 13:36:37,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-28 13:36:37,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 13:36:37,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-28 13:36:37,225 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-28 13:36:37,225 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-28 13:36:37,225 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 13:36:37,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-11-28 13:36:37,226 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-28 13:36:37,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:36:37,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:36:37,227 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:36:37,227 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:36:37,227 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-28 13:36:37,227 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-28 13:36:37,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:36:37,227 INFO L82 PathProgramCache]: Analyzing trace with hash 123162473, now seen corresponding path program 1 times [2018-11-28 13:36:37,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:36:37,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:36:37,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:37,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:36:37,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:37,233 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 13:36:37,233 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 13:36:37,233 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dff998f4-c0c1-4f1c-8f0b-65f2a625fbf4/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-28 13:36:37,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:36:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:36:37,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:36:37,295 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-28 13:36:37,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:36:37,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-28 13:36:37,310 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:36:37,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:36:37,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 2 times [2018-11-28 13:36:37,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:36:37,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:36:37,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:37,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:36:37,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:36:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:36:37,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:36:37,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:36:37,336 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-28 13:36:37,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:36:37,375 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-11-28 13:36:37,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:36:37,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2018-11-28 13:36:37,376 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-28 13:36:37,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2018-11-28 13:36:37,377 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-28 13:36:37,377 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 13:36:37,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-11-28 13:36:37,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:36:37,377 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-28 13:36:37,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-11-28 13:36:37,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-28 13:36:37,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-28 13:36:37,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-11-28 13:36:37,379 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-28 13:36:37,379 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-28 13:36:37,379 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 13:36:37,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2018-11-28 13:36:37,380 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-28 13:36:37,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:36:37,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:36:37,380 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 13:36:37,380 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:36:37,381 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-28 13:36:37,381 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-28 13:36:37,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:36:37,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1898228857, now seen corresponding path program 2 times [2018-11-28 13:36:37,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:36:37,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:36:37,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:37,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:36:37,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:37,389 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 13:36:37,390 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 13:36:37,390 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dff998f4-c0c1-4f1c-8f0b-65f2a625fbf4/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-28 13:36:37,400 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:36:37,416 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:36:37,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-28 13:36:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:36:37,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:36:37,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 3 times [2018-11-28 13:36:37,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:36:37,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:36:37,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:37,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:36:37,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:36:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:36:37,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:36:37,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1163170153, now seen corresponding path program 1 times [2018-11-28 13:36:37,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:36:37,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:36:37,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:37,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:36:37,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:37,469 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 13:36:37,469 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 13:36:37,469 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dff998f4-c0c1-4f1c-8f0b-65f2a625fbf4/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-28 13:36:37,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:36:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:36:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:36:37,879 WARN L180 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 116 [2018-11-28 13:36:39,521 WARN L180 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2018-11-28 13:36:39,523 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:36:39,523 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:36:39,524 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:36:39,524 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:36:39,524 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:36:39,524 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:36:39,524 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:36:39,524 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:36:39,524 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg_true-unreach-call_true-termination.i_Iteration4_Lasso [2018-11-28 13:36:39,524 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:36:39,524 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:36:39,527 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 13:36:39,553 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-28 13:36:39,554 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-28 13:36:39,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:36:39,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:36:39,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:36:39,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:36:39,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:36:39,565 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-28 13:36:39,566 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-28 13:36:39,598 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 29 [2018-11-28 13:36:40,290 WARN L180 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2018-11-28 13:36:40,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:36:40,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:36:40,309 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-28 13:36:40,309 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-28 13:36:40,310 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-28 13:36:40,311 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-28 13:36:40,312 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-28 13:36:40,313 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-28 13:36:40,314 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-28 13:36:40,315 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-28 13:36:40,316 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 13:36:40,958 WARN L180 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 94 [2018-11-28 13:36:40,971 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-28 13:36:42,090 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2018-11-28 13:36:42,104 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:36:42,104 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:36:42,105 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-28 13:36:42,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:42,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:36:42,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:42,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:42,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:42,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:36:42,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:36:42,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:42,107 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-28 13:36:42,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:42,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:36:42,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:42,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:42,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:42,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:36:42,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:36:42,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:42,109 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-28 13:36:42,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:42,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:36:42,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:42,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:42,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:42,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:36:42,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:36:42,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:42,110 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-28 13:36:42,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:42,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:36:42,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:42,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:42,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:42,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:36:42,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:36:42,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:42,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:36:42,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:42,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:42,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:42,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:42,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:36:42,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:36:42,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:42,115 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-28 13:36:42,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:42,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:36:42,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:42,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:42,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:42,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:36:42,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:36:42,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:42,117 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-28 13:36:42,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:42,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:36:42,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:42,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:42,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:42,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:36:42,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:36:42,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:42,118 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-28 13:36:42,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:42,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:36:42,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:42,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:42,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:42,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:36:42,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:36:42,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:42,120 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-28 13:36:42,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:42,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:36:42,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:42,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:42,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:42,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:36:42,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:36:42,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:42,122 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-28 13:36:42,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:42,122 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:36:42,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:42,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:42,123 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:36:42,123 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:36:42,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:42,129 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-28 13:36:42,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:42,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:42,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:42,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:42,131 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:36:42,131 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:36:42,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:42,134 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-28 13:36:42,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:42,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:42,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:42,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:42,139 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:36:42,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:36:42,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:42,140 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-28 13:36:42,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:42,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:36:42,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:42,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:42,141 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:36:42,141 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:36:42,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:36:42,147 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-28 13:36:42,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:36:42,147 INFO L205 nArgumentSynthesizer]: 6 stem disjuncts [2018-11-28 13:36:42,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:36:42,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:36:42,161 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-28 13:36:42,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:36:42,216 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:36:42,270 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-28 13:36:42,270 INFO L444 ModelExtractionUtils]: 21 out of 31 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-28 13:36:42,271 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:36:42,271 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:36:42,272 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:36:42,272 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-28 13:36:42,298 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-28 13:36:42,299 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 13:36:42,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:36:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:36:42,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:36:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:36:42,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:36:42,337 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-28 13:36:42,338 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-28 13:36:42,338 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-28 13:36:42,360 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-28 13:36:42,361 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-28 13:36:42,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:36:42,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-28 13:36:42,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-28 13:36:42,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:36:42,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-28 13:36:42,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:36:42,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 13:36:42,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:36:42,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2018-11-28 13:36:42,366 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 13:36:42,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 24 transitions. [2018-11-28 13:36:42,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 13:36:42,366 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 13:36:42,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2018-11-28 13:36:42,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:36:42,367 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-11-28 13:36:42,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2018-11-28 13:36:42,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-28 13:36:42,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 13:36:42,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2018-11-28 13:36:42,368 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-11-28 13:36:42,368 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-11-28 13:36:42,368 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 13:36:42,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2018-11-28 13:36:42,372 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 13:36:42,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:36:42,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:36:42,373 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:36:42,373 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:36:42,373 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-28 13:36:42,373 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-28 13:36:42,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:36:42,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1698534614, now seen corresponding path program 1 times [2018-11-28 13:36:42,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:36:42,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:36:42,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:42,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:36:42,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:42,379 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 13:36:42,379 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 13:36:42,379 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dff998f4-c0c1-4f1c-8f0b-65f2a625fbf4/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-28 13:36:42,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:36:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:36:42,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:36:42,415 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-28 13:36:42,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:36:42,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:36:42,441 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:36:42,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:36:42,441 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 1 times [2018-11-28 13:36:42,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:36:42,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:36:42,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:42,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:36:42,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:36:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:36:42,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:36:42,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:36:42,547 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-28 13:36:42,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:36:42,581 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-28 13:36:42,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:36:42,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2018-11-28 13:36:42,582 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 13:36:42,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 26 transitions. [2018-11-28 13:36:42,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-28 13:36:42,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-28 13:36:42,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2018-11-28 13:36:42,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:36:42,583 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-28 13:36:42,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2018-11-28 13:36:42,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-11-28 13:36:42,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 13:36:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-28 13:36:42,585 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-28 13:36:42,585 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-28 13:36:42,585 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 13:36:42,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-11-28 13:36:42,585 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 13:36:42,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:36:42,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:36:42,586 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:36:42,586 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:36:42,586 INFO L794 eck$LassoCheckResult]: Stem: 471#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 470#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 469#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 464#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 465#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 466#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 467#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 477#L11-3 assume !(avg_~i~0 < ~N~0); 460#L11-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 461#L14 main_#t~ret3 := avg_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 474#L11-8 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 475#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 476#L11-8 assume !(avg_~i~0 < ~N~0); 472#L11-9 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 473#L14-1 main_#t~ret6 := avg_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 462#L32-3 [2018-11-28 13:36:42,586 INFO L796 eck$LassoCheckResult]: Loop: 462#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 463#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 462#L32-3 [2018-11-28 13:36:42,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:36:42,586 INFO L82 PathProgramCache]: Analyzing trace with hash 205910964, now seen corresponding path program 1 times [2018-11-28 13:36:42,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:36:42,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:36:42,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:42,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:36:42,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:42,590 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 13:36:42,590 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 13:36:42,590 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dff998f4-c0c1-4f1c-8f0b-65f2a625fbf4/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-28 13:36:42,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:36:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:36:42,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:36:42,649 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-28 13:36:42,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:36:42,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-28 13:36:42,665 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:36:42,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:36:42,666 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 2 times [2018-11-28 13:36:42,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:36:42,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:36:42,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:42,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:36:42,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:36:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:36:42,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:36:42,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:36:42,702 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-28 13:36:42,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:36:42,744 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-28 13:36:42,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:36:42,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 31 transitions. [2018-11-28 13:36:42,745 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 13:36:42,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 31 transitions. [2018-11-28 13:36:42,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-28 13:36:42,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-28 13:36:42,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2018-11-28 13:36:42,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:36:42,746 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-28 13:36:42,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2018-11-28 13:36:42,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2018-11-28 13:36:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 13:36:42,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-28 13:36:42,748 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-28 13:36:42,748 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-28 13:36:42,748 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 13:36:42,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2018-11-28 13:36:42,748 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 13:36:42,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:36:42,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:36:42,749 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:36:42,749 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:36:42,749 INFO L794 eck$LassoCheckResult]: Stem: 569#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 568#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 567#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 562#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 563#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 564#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 565#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 576#L11-3 assume !(avg_~i~0 < ~N~0); 558#L11-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 559#L14 main_#t~ret3 := avg_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 572#L11-8 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 573#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 574#L11-8 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 575#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 577#L11-8 assume !(avg_~i~0 < ~N~0); 570#L11-9 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 571#L14-1 main_#t~ret6 := avg_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 560#L32-3 [2018-11-28 13:36:42,749 INFO L796 eck$LassoCheckResult]: Loop: 560#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 561#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 560#L32-3 [2018-11-28 13:36:42,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:36:42,749 INFO L82 PathProgramCache]: Analyzing trace with hash 313660178, now seen corresponding path program 2 times [2018-11-28 13:36:42,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:36:42,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:36:42,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:42,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:36:42,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:42,753 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 13:36:42,754 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 13:36:42,754 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dff998f4-c0c1-4f1c-8f0b-65f2a625fbf4/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-28 13:36:42,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:36:42,799 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:36:42,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-28 13:36:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:36:42,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:36:42,840 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 3 times [2018-11-28 13:36:42,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:36:42,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:36:42,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:42,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:36:42,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:36:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:36:42,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:36:42,846 INFO L82 PathProgramCache]: Analyzing trace with hash 779721780, now seen corresponding path program 1 times [2018-11-28 13:36:42,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:36:42,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:36:42,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:42,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:36:42,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:36:42,852 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 13:36:42,852 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 13:36:42,852 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dff998f4-c0c1-4f1c-8f0b-65f2a625fbf4/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-28 13:36:42,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:36:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:36:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:36:44,125 WARN L180 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 189 DAG size of output: 158 [2018-11-28 13:36:55,090 WARN L180 SmtUtils]: Spent 10.56 s on a formula simplification. DAG size of input: 415 DAG size of output: 111 [2018-11-28 13:36:55,092 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:36:55,092 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:36:55,092 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:36:55,092 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:36:55,092 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:36:55,092 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:36:55,092 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:36:55,092 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:36:55,092 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg_true-unreach-call_true-termination.i_Iteration7_Lasso [2018-11-28 13:36:55,092 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:36:55,092 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:36:55,094 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 13:36:55,162 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-28 13:36:55,171 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-28 13:36:55,173 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-28 13:36:55,179 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-28 13:36:55,180 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-28 13:36:55,181 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-28 13:36:55,183 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-28 13:36:55,187 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-28 13:36:55,188 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-28 13:36:55,190 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-28 13:36:55,191 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-28 13:36:55,307 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 110 [2018-11-28 13:36:58,400 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 6317 conjuctions. This might take some time... [2018-11-28 13:36:58,437 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 6 conjuctions. [2018-11-28 13:36:59,532 WARN L180 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 108 DAG size of output: 97 [2018-11-28 13:36:59,571 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-28 13:36:59,572 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-28 13:36:59,573 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-28 13:36:59,573 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-28 13:36:59,574 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-28 13:36:59,576 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 13:37:06,508 WARN L180 SmtUtils]: Spent 6.84 s on a formula simplification. DAG size of input: 299 DAG size of output: 164 [2018-11-28 13:37:06,614 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-28 13:37:06,625 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2018-11-28 13:37:12,231 WARN L180 SmtUtils]: Spent 5.56 s on a formula simplification. DAG size of input: 203 DAG size of output: 148 [2018-11-28 13:37:12,266 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:37:12,266 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:37:12,267 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-28 13:37:12,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:37:12,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:37:12,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:37:12,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:37:12,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:37:12,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:37:12,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:37:12,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:37:12,269 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-28 13:37:12,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:37:12,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:37:12,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:37:12,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:37:12,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:37:12,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:37:12,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:37:12,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:37:12,270 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-28 13:37:12,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:37:12,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:37:12,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:37:12,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:37:12,271 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:37:12,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:37:12,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:37:12,273 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-28 13:37:12,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:37:12,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:37:12,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:37:12,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:37:12,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:37:12,273 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:37:12,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:37:12,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:37:12,274 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-28 13:37:12,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:37:12,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:37:12,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:37:12,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:37:12,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:37:12,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:37:12,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:37:12,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:37:12,275 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-28 13:37:12,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:37:12,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:37:12,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:37:12,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:37:12,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:37:12,276 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:37:12,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:37:12,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:37:12,276 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-28 13:37:12,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:37:12,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:37:12,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:37:12,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:37:12,277 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:37:12,277 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:37:12,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:37:12,279 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-28 13:37:12,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:37:12,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:37:12,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:37:12,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:37:12,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:37:12,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:37:12,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:37:12,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:37:12,280 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-28 13:37:12,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:37:12,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:37:12,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:37:12,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:37:12,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:37:12,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:37:12,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:37:12,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:37:12,282 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-28 13:37:12,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:37:12,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:37:12,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:37:12,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:37:12,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:37:12,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:37:12,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:37:12,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:37:12,283 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-28 13:37:12,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:37:12,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:37:12,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:37:12,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:37:12,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:37:12,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:37:12,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:37:12,287 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-28 13:37:12,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:37:12,288 INFO L205 nArgumentSynthesizer]: 6 stem disjuncts [2018-11-28 13:37:12,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:37:12,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:37:12,297 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-28 13:37:12,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:37:12,348 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:37:12,398 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 13:37:12,398 INFO L444 ModelExtractionUtils]: 54 out of 61 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 13:37:12,399 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:37:12,399 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:37:12,400 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:37:12,400 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-28 13:37:12,450 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-28 13:37:12,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:37:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:37:12,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:37:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:37:12,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:37:12,492 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-28 13:37:12,492 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-28 13:37:12,492 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-28 13:37:12,506 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-28 13:37:12,507 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-28 13:37:12,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:37:12,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-28 13:37:12,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 2 letters. [2018-11-28 13:37:12,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:37:12,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 19 letters. Loop has 2 letters. [2018-11-28 13:37:12,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:37:12,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 4 letters. [2018-11-28 13:37:12,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:37:12,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2018-11-28 13:37:12,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:37:12,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 27 transitions. [2018-11-28 13:37:12,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 13:37:12,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 13:37:12,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2018-11-28 13:37:12,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:37:12,510 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-28 13:37:12,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2018-11-28 13:37:12,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-28 13:37:12,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 13:37:12,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-28 13:37:12,511 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-28 13:37:12,511 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-28 13:37:12,511 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 13:37:12,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-11-28 13:37:12,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:37:12,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:37:12,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:37:12,512 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:37:12,512 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:37:12,513 INFO L794 eck$LassoCheckResult]: Stem: 735#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 734#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 733#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 728#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 729#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 730#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 731#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 742#L11-3 assume !(avg_~i~0 < ~N~0); 723#L11-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 724#L14 main_#t~ret3 := avg_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 738#L11-8 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 739#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 740#L11-8 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 741#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 743#L11-8 assume !(avg_~i~0 < ~N~0); 736#L11-9 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 737#L14-1 main_#t~ret6 := avg_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 725#L32-3 assume !(main_~i~1 < ~N~0 - 1); 721#L32-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 722#L11-13 [2018-11-28 13:37:12,513 INFO L796 eck$LassoCheckResult]: Loop: 722#L11-13 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 732#L11-12 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 722#L11-13 [2018-11-28 13:37:12,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:37:12,513 INFO L82 PathProgramCache]: Analyzing trace with hash 779721722, now seen corresponding path program 1 times [2018-11-28 13:37:12,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:37:12,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:37:12,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:37:12,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:37:12,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:37:12,525 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 13:37:12,525 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 13:37:12,525 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dff998f4-c0c1-4f1c-8f0b-65f2a625fbf4/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-28 13:37:12,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:37:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:37:12,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:37:12,595 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-28 13:37:12,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:37:12,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:37:12,621 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:37:12,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:37:12,621 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 1 times [2018-11-28 13:37:12,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:37:12,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:37:12,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:37:12,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:37:12,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:37:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:37:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:37:12,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:37:12,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:37:12,650 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-28 13:37:12,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:37:12,717 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-28 13:37:12,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:37:12,718 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 27 transitions. [2018-11-28 13:37:12,719 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:37:12,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 27 transitions. [2018-11-28 13:37:12,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 13:37:12,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 13:37:12,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2018-11-28 13:37:12,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:37:12,720 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-28 13:37:12,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2018-11-28 13:37:12,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-28 13:37:12,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 13:37:12,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-11-28 13:37:12,721 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-28 13:37:12,721 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-28 13:37:12,721 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 13:37:12,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2018-11-28 13:37:12,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:37:12,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:37:12,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:37:12,722 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-28 13:37:12,722 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:37:12,722 INFO L794 eck$LassoCheckResult]: Stem: 843#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 842#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 841#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 836#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 837#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 838#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 839#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 850#L11-3 assume !(avg_~i~0 < ~N~0); 831#L11-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 832#L14 main_#t~ret3 := avg_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 846#L11-8 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 847#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 848#L11-8 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 849#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 851#L11-8 assume !(avg_~i~0 < ~N~0); 844#L11-9 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 845#L14-1 main_#t~ret6 := avg_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 833#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 834#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 835#L32-3 assume !(main_~i~1 < ~N~0 - 1); 829#L32-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 830#L11-13 [2018-11-28 13:37:12,724 INFO L796 eck$LassoCheckResult]: Loop: 830#L11-13 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 840#L11-12 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 830#L11-13 [2018-11-28 13:37:12,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:37:12,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1988322460, now seen corresponding path program 1 times [2018-11-28 13:37:12,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:37:12,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:37:12,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:37:12,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:37:12,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:37:12,728 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 13:37:12,728 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 13:37:12,728 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dff998f4-c0c1-4f1c-8f0b-65f2a625fbf4/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-28 13:37:12,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:37:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:37:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:37:12,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:37:12,810 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 2 times [2018-11-28 13:37:12,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:37:12,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:37:12,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:37:12,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:37:12,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:37:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:37:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:37:12,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:37:12,814 INFO L82 PathProgramCache]: Analyzing trace with hash -482560770, now seen corresponding path program 1 times [2018-11-28 13:37:12,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:37:12,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:37:12,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:37:12,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:37:12,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:37:12,817 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 13:37:12,817 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 13:37:12,817 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dff998f4-c0c1-4f1c-8f0b-65f2a625fbf4/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-28 13:37:12,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:37:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:37:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:37:14,202 WARN L180 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 231 DAG size of output: 193 [2018-11-28 13:37:20,154 WARN L180 SmtUtils]: Spent 5.78 s on a formula simplification. DAG size of input: 230 DAG size of output: 116 [2018-11-28 13:37:20,156 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:37:20,156 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:37:20,156 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:37:20,156 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:37:20,156 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:37:20,156 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:37:20,156 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:37:20,156 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:37:20,157 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg_true-unreach-call_true-termination.i_Iteration9_Lasso [2018-11-28 13:37:20,157 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:37:20,157 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:37:20,158 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 13:37:20,211 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-28 13:37:20,222 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-28 13:37:20,227 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-28 13:37:20,228 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-28 13:37:20,230 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-28 13:37:20,231 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-28 13:37:20,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:37:20,234 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-28 13:37:20,238 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-28 13:37:20,239 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-28 13:37:20,240 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-28 13:37:20,241 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-28 13:37:20,242 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-28 13:37:20,243 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-28 13:37:20,244 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-28 13:37:20,317 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 109 [2018-11-28 13:37:22,154 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 5476 conjuctions. This might take some time... [2018-11-28 13:37:22,198 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 10 conjuctions. [2018-11-28 13:37:23,472 WARN L180 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 102 DAG size of output: 85 [2018-11-28 13:37:23,486 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-28 13:37:23,487 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-28 13:37:23,488 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-28 13:37:23,489 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 13:37:24,733 WARN L180 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 234 DAG size of output: 118 [2018-11-28 13:37:24,760 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-28 13:37:26,798 WARN L180 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 213 DAG size of output: 102 [2018-11-28 13:37:26,836 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:37:26,836 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:37:26,837 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-28 13:37:26,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:37:26,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:37:26,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:37:26,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:37:26,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:37:26,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:37:26,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:37:26,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:37:26,839 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-28 13:37:26,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:37:26,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:37:26,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:37:26,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:37:26,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:37:26,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:37:26,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:37:26,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:37:26,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:37:26,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:37:26,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:37:26,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:37:26,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:37:26,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:37:26,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:37:26,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:37:26,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:37:26,842 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-28 13:37:26,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:37:26,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:37:26,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:37:26,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:37:26,844 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:37:26,844 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:37:26,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:37:26,845 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-28 13:37:26,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:37:26,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:37:26,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:37:26,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:37:26,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:37:26,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:37:26,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:37:26,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:37:26,847 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-28 13:37:26,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:37:26,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:37:26,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:37:26,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:37:26,848 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:37:26,848 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:37:26,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:37:26,849 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-28 13:37:26,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:37:26,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:37:26,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:37:26,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:37:26,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:37:26,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:37:26,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:37:26,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:37:26,851 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-28 13:37:26,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:37:26,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:37:26,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:37:26,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:37:26,852 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:37:26,852 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:37:26,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:37:26,854 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-28 13:37:26,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:37:26,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:37:26,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:37:26,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:37:26,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:37:26,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:37:26,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:37:26,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:37:26,855 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-28 13:37:26,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:37:26,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:37:26,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:37:26,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:37:26,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:37:26,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:37:26,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:37:26,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:37:26,857 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-28 13:37:26,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:37:26,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:37:26,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:37:26,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:37:26,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:37:26,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:37:26,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:37:26,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:37:26,859 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-28 13:37:26,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:37:26,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:37:26,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:37:26,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:37:26,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:37:26,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:37:26,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:37:26,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:37:26,860 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-28 13:37:26,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:37:26,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:37:26,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:37:26,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:37:26,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:37:26,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:37:26,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:37:26,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:37:26,862 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-28 13:37:26,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:37:26,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:37:26,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:37:26,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:37:26,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:37:26,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:37:26,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:37:26,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:37:26,864 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-28 13:37:26,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:37:26,864 INFO L205 nArgumentSynthesizer]: 6 stem disjuncts [2018-11-28 13:37:26,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:37:26,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:37:26,869 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-28 13:37:26,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:37:26,921 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:37:26,948 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 13:37:26,948 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 13:37:26,949 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:37:26,949 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:37:26,950 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:37:26,950 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-28 13:37:26,961 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-28 13:37:26,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:37:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:37:27,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:37:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:37:27,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:37:27,018 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-28 13:37:27,018 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-28 13:37:27,018 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-28 13:37:27,026 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-28 13:37:27,027 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-28 13:37:27,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:37:27,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-28 13:37:27,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 21 letters. Loop has 2 letters. [2018-11-28 13:37:27,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:37:27,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 23 letters. Loop has 2 letters. [2018-11-28 13:37:27,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:37:27,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 21 letters. Loop has 4 letters. [2018-11-28 13:37:27,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:37:27,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2018-11-28 13:37:27,029 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:37:27,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2018-11-28 13:37:27,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 13:37:27,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 13:37:27,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 13:37:27,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:37:27,030 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:37:27,030 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:37:27,030 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:37:27,030 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 13:37:27,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:37:27,030 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:37:27,030 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 13:37:27,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 01:37:27 BoogieIcfgContainer [2018-11-28 13:37:27,037 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 13:37:27,038 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:37:27,038 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:37:27,038 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:37:27,038 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:36:36" (3/4) ... [2018-11-28 13:37:27,042 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 13:37:27,042 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:37:27,043 INFO L168 Benchmark]: Toolchain (without parser) took 51457.04 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.9 GB). Free memory was 958.7 MB in the beginning and 617.1 MB in the end (delta: 341.6 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2018-11-28 13:37:27,044 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:37:27,044 INFO L168 Benchmark]: CACSL2BoogieTranslator took 146.66 ms. Allocated memory is still 1.0 GB. Free memory was 958.7 MB in the beginning and 947.8 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-28 13:37:27,044 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 947.8 MB in the beginning and 1.1 GB in the end (delta: -178.6 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2018-11-28 13:37:27,045 INFO L168 Benchmark]: Boogie Preprocessor took 22.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:37:27,046 INFO L168 Benchmark]: RCFGBuilder took 248.77 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: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2018-11-28 13:37:27,046 INFO L168 Benchmark]: BuchiAutomizer took 50967.11 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 617.1 MB in the end (delta: 484.6 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2018-11-28 13:37:27,047 INFO L168 Benchmark]: Witness Printer took 4.45 ms. Allocated memory is still 2.9 GB. Free memory is still 617.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:37:27,050 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 146.66 ms. Allocated memory is still 1.0 GB. Free memory was 958.7 MB in the beginning and 947.8 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 947.8 MB in the beginning and 1.1 GB in the end (delta: -178.6 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 248.77 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: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 50967.11 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 617.1 MB in the end (delta: 484.6 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Witness Printer took 4.45 ms. Allocated memory is still 2.9 GB. Free memory is still 617.1 MB. 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 + unknown-#length-unknown[x] + -4 * i 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 50.9s and 10 iterations. TraceHistogramMax:2. Analysis of lassos took 50.3s. 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, 12 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 23 states and ocurred in iteration 7. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 104 SDtfs, 99 SDslu, 26 SDs, 0 SdLazy, 185 SolverSat, 22 SolverUnsat, 1 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 lsp366 div63 bol100 ite100 ukn100 eq168 hnf93 smp43 dnf1841 smp34 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 125ms 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...