./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/reducercommutativity/avg05_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a9f03261-b82a-4cbb-918c-b55c39a12ebf/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a9f03261-b82a-4cbb-918c-b55c39a12ebf/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a9f03261-b82a-4cbb-918c-b55c39a12ebf/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a9f03261-b82a-4cbb-918c-b55c39a12ebf/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/avg05_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a9f03261-b82a-4cbb-918c-b55c39a12ebf/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a9f03261-b82a-4cbb-918c-b55c39a12ebf/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 3cd0186843eb184a03f25fecfe7ca0b9c84c33a9 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 06:10:36,789 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 06:10:36,790 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 06:10:36,798 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 06:10:36,798 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 06:10:36,799 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 06:10:36,799 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 06:10:36,801 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 06:10:36,802 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 06:10:36,802 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 06:10:36,803 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 06:10:36,803 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 06:10:36,804 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 06:10:36,805 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 06:10:36,805 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 06:10:36,806 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 06:10:36,807 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 06:10:36,808 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 06:10:36,809 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 06:10:36,810 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 06:10:36,811 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 06:10:36,812 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 06:10:36,813 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 06:10:36,814 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 06:10:36,814 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 06:10:36,815 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 06:10:36,815 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 06:10:36,816 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 06:10:36,816 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 06:10:36,817 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 06:10:36,817 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 06:10:36,818 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 06:10:36,818 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 06:10:36,818 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 06:10:36,819 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 06:10:36,819 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 06:10:36,820 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a9f03261-b82a-4cbb-918c-b55c39a12ebf/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 06:10:36,831 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 06:10:36,831 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 06:10:36,832 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 06:10:36,832 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 06:10:36,832 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 06:10:36,833 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 06:10:36,833 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 06:10:36,833 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 06:10:36,833 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 06:10:36,833 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 06:10:36,833 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 06:10:36,833 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 06:10:36,834 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 06:10:36,834 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 06:10:36,834 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 06:10:36,834 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 06:10:36,834 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 06:10:36,834 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 06:10:36,834 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 06:10:36,835 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 06:10:36,835 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 06:10:36,835 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 06:10:36,835 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 06:10:36,835 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 06:10:36,835 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 06:10:36,835 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 06:10:36,836 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 06:10:36,836 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 06:10:36,836 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 06:10:36,836 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 06:10:36,837 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 06:10:36,837 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_a9f03261-b82a-4cbb-918c-b55c39a12ebf/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 -> 3cd0186843eb184a03f25fecfe7ca0b9c84c33a9 [2018-11-10 06:10:36,861 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 06:10:36,869 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 06:10:36,872 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 06:10:36,873 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 06:10:36,873 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 06:10:36,874 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a9f03261-b82a-4cbb-918c-b55c39a12ebf/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/avg05_true-unreach-call_true-termination.i [2018-11-10 06:10:36,910 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a9f03261-b82a-4cbb-918c-b55c39a12ebf/bin-2019/uautomizer/data/613afcd3e/07f548d60dd44d9f997d4b6cb0cfc52d/FLAG54093d75b [2018-11-10 06:10:37,204 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 06:10:37,204 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a9f03261-b82a-4cbb-918c-b55c39a12ebf/sv-benchmarks/c/reducercommutativity/avg05_true-unreach-call_true-termination.i [2018-11-10 06:10:37,208 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a9f03261-b82a-4cbb-918c-b55c39a12ebf/bin-2019/uautomizer/data/613afcd3e/07f548d60dd44d9f997d4b6cb0cfc52d/FLAG54093d75b [2018-11-10 06:10:37,216 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a9f03261-b82a-4cbb-918c-b55c39a12ebf/bin-2019/uautomizer/data/613afcd3e/07f548d60dd44d9f997d4b6cb0cfc52d [2018-11-10 06:10:37,218 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 06:10:37,219 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 06:10:37,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 06:10:37,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 06:10:37,222 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 06:10:37,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:10:37" (1/1) ... [2018-11-10 06:10:37,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5facec28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:10:37, skipping insertion in model container [2018-11-10 06:10:37,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:10:37" (1/1) ... [2018-11-10 06:10:37,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 06:10:37,243 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 06:10:37,349 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:10:37,355 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 06:10:37,369 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:10:37,380 INFO L193 MainTranslator]: Completed translation [2018-11-10 06:10:37,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:10:37 WrapperNode [2018-11-10 06:10:37,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 06:10:37,380 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 06:10:37,380 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 06:10:37,380 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 06:10:37,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:10:37" (1/1) ... [2018-11-10 06:10:37,395 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:10:37" (1/1) ... [2018-11-10 06:10:37,416 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 06:10:37,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 06:10:37,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 06:10:37,416 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 06:10:37,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:10:37" (1/1) ... [2018-11-10 06:10:37,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:10:37" (1/1) ... [2018-11-10 06:10:37,426 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:10:37" (1/1) ... [2018-11-10 06:10:37,426 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:10:37" (1/1) ... [2018-11-10 06:10:37,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:10:37" (1/1) ... [2018-11-10 06:10:37,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:10:37" (1/1) ... [2018-11-10 06:10:37,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:10:37" (1/1) ... [2018-11-10 06:10:37,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 06:10:37,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 06:10:37,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 06:10:37,439 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 06:10:37,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:10:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9f03261-b82a-4cbb-918c-b55c39a12ebf/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:10:37,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 06:10:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 06:10:37,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 06:10:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 06:10:37,725 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 06:10:37,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:10:37 BoogieIcfgContainer [2018-11-10 06:10:37,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 06:10:37,726 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 06:10:37,726 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 06:10:37,730 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 06:10:37,730 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:10:37,731 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 06:10:37" (1/3) ... [2018-11-10 06:10:37,732 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f0c91d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 06:10:37, skipping insertion in model container [2018-11-10 06:10:37,732 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:10:37,732 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:10:37" (2/3) ... [2018-11-10 06:10:37,732 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f0c91d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 06:10:37, skipping insertion in model container [2018-11-10 06:10:37,732 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:10:37,732 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:10:37" (3/3) ... [2018-11-10 06:10:37,734 INFO L375 chiAutomizerObserver]: Analyzing ICFG avg05_true-unreach-call_true-termination.i [2018-11-10 06:10:37,784 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 06:10:37,784 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 06:10:37,785 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 06:10:37,785 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 06:10:37,785 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 06:10:37,785 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 06:10:37,785 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 06:10:37,785 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 06:10:37,785 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 06:10:37,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states. [2018-11-10 06:10:37,813 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 26 [2018-11-10 06:10:37,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:10:37,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:10:37,818 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:10:37,818 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 06:10:37,818 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 06:10:37,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states. [2018-11-10 06:10:37,821 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 26 [2018-11-10 06:10:37,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:10:37,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:10:37,821 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:10:37,821 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 06:10:37,826 INFO L793 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 18#L23-4true [2018-11-10 06:10:37,827 INFO L795 eck$LassoCheckResult]: Loop: 18#L23-4true assume true; 37#L23-1true assume !!(main_~i~1 < 5); 52#L24true SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 51#L24-1true havoc main_#t~nondet3; 21#L23-3true main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 18#L23-4true [2018-11-10 06:10:37,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:37,832 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 06:10:37,833 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:37,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:37,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:37,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:10:37,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:37,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:37,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:37,906 INFO L82 PathProgramCache]: Analyzing trace with hash 34509928, now seen corresponding path program 1 times [2018-11-10 06:10:37,906 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:37,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:37,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:37,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:10:37,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:37,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:37,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1805949414, now seen corresponding path program 1 times [2018-11-10 06:10:37,920 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:37,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:37,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:37,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:10:37,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:38,092 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:10:38,094 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:10:38,094 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:10:38,094 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:10:38,094 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:10:38,094 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:10:38,094 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:10:38,095 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:10:38,095 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg05_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-10 06:10:38,095 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:10:38,095 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:10:38,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:38,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:38,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:38,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:38,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:38,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-10 06:10:38,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-10 06:10:38,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:38,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:38,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:38,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:38,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:38,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:38,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:38,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:38,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:38,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:38,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:38,484 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:10:38,488 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:10:38,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:10:38,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:10:38,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:10:38,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:10:38,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:10:38,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:10:38,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:10:38,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:10:38,498 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:10:38,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:10:38,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:10:38,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:10:38,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:10:38,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:10:38,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:10:38,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:10:38,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:10:38,501 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:10:38,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:10:38,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:10:38,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:10:38,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:10:38,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:10:38,505 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:10:38,505 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:10:38,511 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:10:38,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:10:38,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:10:38,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:10:38,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:10:38,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:10:38,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:10:38,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:10:38,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:10:38,514 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:10:38,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:10:38,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:10:38,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:10:38,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:10:38,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:10:38,517 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:10:38,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:10:38,533 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:10:38,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:10:38,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:10:38,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:10:38,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:10:38,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:10:38,540 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:10:38,540 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:10:38,576 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 06:10:38,598 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 06:10:38,598 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 06:10:38,601 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 06:10:38,602 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 06:10:38,603 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 06:10:38,603 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1, ULTIMATE.start_main_~i~1) = 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 - 8*ULTIMATE.start_main_~i~1 Supporting invariants [] [2018-11-10 06:10:38,632 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 06:10:38,640 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 06:10:38,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:10:38,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:10:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:10:38,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:10:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:10:38,711 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 06:10:38,712 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states. Second operand 5 states. [2018-11-10 06:10:38,818 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states.. Second operand 5 states. Result 141 states and 165 transitions. Complement of second has 10 states. [2018-11-10 06:10:38,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 06:10:38,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 06:10:38,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2018-11-10 06:10:38,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 110 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-10 06:10:38,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:10:38,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 110 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-10 06:10:38,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:10:38,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 110 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-10 06:10:38,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:10:38,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 165 transitions. [2018-11-10 06:10:38,829 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-11-10 06:10:38,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 46 states and 51 transitions. [2018-11-10 06:10:38,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-10 06:10:38,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-10 06:10:38,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 51 transitions. [2018-11-10 06:10:38,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:10:38,835 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-11-10 06:10:38,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 51 transitions. [2018-11-10 06:10:38,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-10 06:10:38,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-10 06:10:38,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-11-10 06:10:38,854 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-11-10 06:10:38,854 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-11-10 06:10:38,854 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 06:10:38,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 51 transitions. [2018-11-10 06:10:38,855 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-11-10 06:10:38,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:10:38,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:10:38,855 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 06:10:38,856 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 06:10:38,856 INFO L793 eck$LassoCheckResult]: Stem: 301#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 272#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 273#L23-4 assume true; 280#L23-1 assume !(main_~i~1 < 5); 281#L23-5 assume { :begin_inline_avg } true;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; 259#L9-4 [2018-11-10 06:10:38,856 INFO L795 eck$LassoCheckResult]: Loop: 259#L9-4 assume true; 260#L9-1 assume !!(avg_~i~0 < 5); 266#L10 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10 276#L10-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 262#L9-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 259#L9-4 [2018-11-10 06:10:38,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:38,856 INFO L82 PathProgramCache]: Analyzing trace with hash 28694797, now seen corresponding path program 1 times [2018-11-10 06:10:38,856 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:38,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:38,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:38,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:10:38,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:10:38,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:10:38,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:10:38,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:10:38,882 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 06:10:38,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:38,882 INFO L82 PathProgramCache]: Analyzing trace with hash 50733113, now seen corresponding path program 1 times [2018-11-10 06:10:38,882 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:38,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:38,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:38,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:10:38,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:38,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:10:38,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:10:38,934 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-10 06:10:38,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:10:38,945 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-10 06:10:38,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:10:38,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 55 transitions. [2018-11-10 06:10:38,949 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-11-10 06:10:38,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 50 states and 54 transitions. [2018-11-10 06:10:38,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-10 06:10:38,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-10 06:10:38,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 54 transitions. [2018-11-10 06:10:38,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:10:38,951 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-10 06:10:38,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 54 transitions. [2018-11-10 06:10:38,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-11-10 06:10:38,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-10 06:10:38,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-10 06:10:38,953 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-10 06:10:38,953 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-10 06:10:38,954 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 06:10:38,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 50 transitions. [2018-11-10 06:10:38,954 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-11-10 06:10:38,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:10:38,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:10:38,955 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:10:38,955 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 06:10:38,955 INFO L793 eck$LassoCheckResult]: Stem: 403#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 372#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 373#L23-4 assume true; 385#L23-1 assume !!(main_~i~1 < 5); 386#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 405#L24-1 havoc main_#t~nondet3; 401#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 400#L23-4 assume true; 383#L23-1 assume !(main_~i~1 < 5); 384#L23-5 assume { :begin_inline_avg } true;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; 362#L9-4 [2018-11-10 06:10:38,955 INFO L795 eck$LassoCheckResult]: Loop: 362#L9-4 assume true; 363#L9-1 assume !!(avg_~i~0 < 5); 369#L10 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10 379#L10-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 365#L9-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 362#L9-4 [2018-11-10 06:10:38,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:38,956 INFO L82 PathProgramCache]: Analyzing trace with hash -2016318454, now seen corresponding path program 1 times [2018-11-10 06:10:38,956 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:38,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:38,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:38,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:10:38,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:10:38,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:10:38,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:10:38,991 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9f03261-b82a-4cbb-918c-b55c39a12ebf/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:10:39,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:10:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:10:39,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:10:39,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:10:39,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:10:39,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-10 06:10:39,046 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 06:10:39,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:39,046 INFO L82 PathProgramCache]: Analyzing trace with hash 50733113, now seen corresponding path program 2 times [2018-11-10 06:10:39,046 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:39,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:39,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:39,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:10:39,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:39,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 06:10:39,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:10:39,071 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-10 06:10:39,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:10:39,085 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-11-10 06:10:39,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 06:10:39,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 60 transitions. [2018-11-10 06:10:39,087 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-11-10 06:10:39,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 55 states and 59 transitions. [2018-11-10 06:10:39,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-10 06:10:39,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-10 06:10:39,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 59 transitions. [2018-11-10 06:10:39,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:10:39,088 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-10 06:10:39,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 59 transitions. [2018-11-10 06:10:39,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-11-10 06:10:39,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-10 06:10:39,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-10 06:10:39,091 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-10 06:10:39,091 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-10 06:10:39,091 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 06:10:39,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 55 transitions. [2018-11-10 06:10:39,092 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-11-10 06:10:39,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:10:39,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:10:39,093 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-10 06:10:39,093 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 06:10:39,093 INFO L793 eck$LassoCheckResult]: Stem: 541#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 509#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 510#L23-4 assume true; 537#L23-1 assume !!(main_~i~1 < 5); 547#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 546#L24-1 havoc main_#t~nondet3; 539#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 538#L23-4 assume true; 522#L23-1 assume !!(main_~i~1 < 5); 523#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 543#L24-1 havoc main_#t~nondet3; 544#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 545#L23-4 assume true; 520#L23-1 assume !(main_~i~1 < 5); 521#L23-5 assume { :begin_inline_avg } true;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; 499#L9-4 [2018-11-10 06:10:39,093 INFO L795 eck$LassoCheckResult]: Loop: 499#L9-4 assume true; 500#L9-1 assume !!(avg_~i~0 < 5); 506#L10 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10 516#L10-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 502#L9-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 499#L9-4 [2018-11-10 06:10:39,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:39,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1843081005, now seen corresponding path program 2 times [2018-11-10 06:10:39,094 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:39,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:39,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:39,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:10:39,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:10:39,131 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:10:39,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:10:39,131 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9f03261-b82a-4cbb-918c-b55c39a12ebf/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:10:39,140 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 06:10:39,154 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 06:10:39,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:10:39,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:10:39,162 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:10:39,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:10:39,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-10 06:10:39,189 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 06:10:39,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:39,189 INFO L82 PathProgramCache]: Analyzing trace with hash 50733113, now seen corresponding path program 3 times [2018-11-10 06:10:39,189 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:39,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:39,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:39,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:10:39,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:39,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 06:10:39,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-10 06:10:39,224 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-11-10 06:10:39,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:10:39,251 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-10 06:10:39,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 06:10:39,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 65 transitions. [2018-11-10 06:10:39,253 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-11-10 06:10:39,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 60 states and 64 transitions. [2018-11-10 06:10:39,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-10 06:10:39,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-10 06:10:39,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 64 transitions. [2018-11-10 06:10:39,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:10:39,255 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-10 06:10:39,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 64 transitions. [2018-11-10 06:10:39,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2018-11-10 06:10:39,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 06:10:39,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-10 06:10:39,259 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-10 06:10:39,259 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-10 06:10:39,259 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 06:10:39,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 60 transitions. [2018-11-10 06:10:39,261 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-11-10 06:10:39,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:10:39,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:10:39,262 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1] [2018-11-10 06:10:39,262 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 06:10:39,262 INFO L793 eck$LassoCheckResult]: Stem: 706#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 675#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 676#L23-4 assume true; 700#L23-1 assume !!(main_~i~1 < 5); 715#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 714#L24-1 havoc main_#t~nondet3; 713#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 701#L23-4 assume true; 685#L23-1 assume !!(main_~i~1 < 5); 686#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 707#L24-1 havoc main_#t~nondet3; 702#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 703#L23-4 assume true; 709#L23-1 assume !!(main_~i~1 < 5); 712#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 711#L24-1 havoc main_#t~nondet3; 710#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 708#L23-4 assume true; 683#L23-1 assume !(main_~i~1 < 5); 684#L23-5 assume { :begin_inline_avg } true;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; 662#L9-4 [2018-11-10 06:10:39,263 INFO L795 eck$LassoCheckResult]: Loop: 662#L9-4 assume true; 663#L9-1 assume !!(avg_~i~0 < 5); 669#L10 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10 679#L10-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 665#L9-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 662#L9-4 [2018-11-10 06:10:39,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:39,263 INFO L82 PathProgramCache]: Analyzing trace with hash -500373014, now seen corresponding path program 3 times [2018-11-10 06:10:39,263 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:39,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:39,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:39,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:10:39,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:10:39,298 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:10:39,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:10:39,298 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9f03261-b82a-4cbb-918c-b55c39a12ebf/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:10:39,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 06:10:39,325 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 06:10:39,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:10:39,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:10:39,333 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:10:39,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:10:39,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-10 06:10:39,350 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 06:10:39,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:39,350 INFO L82 PathProgramCache]: Analyzing trace with hash 50733113, now seen corresponding path program 4 times [2018-11-10 06:10:39,350 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:39,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:39,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:39,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:10:39,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:39,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 06:10:39,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 06:10:39,380 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-11-10 06:10:39,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:10:39,398 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-10 06:10:39,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 06:10:39,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 70 transitions. [2018-11-10 06:10:39,400 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-11-10 06:10:39,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 65 states and 69 transitions. [2018-11-10 06:10:39,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-10 06:10:39,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-10 06:10:39,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 69 transitions. [2018-11-10 06:10:39,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:10:39,401 INFO L705 BuchiCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-11-10 06:10:39,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 69 transitions. [2018-11-10 06:10:39,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2018-11-10 06:10:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-10 06:10:39,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-11-10 06:10:39,404 INFO L728 BuchiCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-11-10 06:10:39,404 INFO L608 BuchiCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-11-10 06:10:39,404 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 06:10:39,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 65 transitions. [2018-11-10 06:10:39,405 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-11-10 06:10:39,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:10:39,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:10:39,406 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 1, 1, 1, 1] [2018-11-10 06:10:39,406 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 06:10:39,406 INFO L793 eck$LassoCheckResult]: Stem: 894#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 861#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 862#L23-4 assume true; 889#L23-1 assume !!(main_~i~1 < 5); 909#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 908#L24-1 havoc main_#t~nondet3; 907#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 890#L23-4 assume true; 874#L23-1 assume !!(main_~i~1 < 5); 875#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 896#L24-1 havoc main_#t~nondet3; 891#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 892#L23-4 assume true; 906#L23-1 assume !!(main_~i~1 < 5); 905#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 904#L24-1 havoc main_#t~nondet3; 903#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 902#L23-4 assume true; 898#L23-1 assume !!(main_~i~1 < 5); 901#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 900#L24-1 havoc main_#t~nondet3; 899#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 897#L23-4 assume true; 872#L23-1 assume !(main_~i~1 < 5); 873#L23-5 assume { :begin_inline_avg } true;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; 851#L9-4 [2018-11-10 06:10:39,406 INFO L795 eck$LassoCheckResult]: Loop: 851#L9-4 assume true; 852#L9-1 assume !!(avg_~i~0 < 5); 858#L10 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10 868#L10-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 854#L9-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 851#L9-4 [2018-11-10 06:10:39,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:39,406 INFO L82 PathProgramCache]: Analyzing trace with hash 543382861, now seen corresponding path program 4 times [2018-11-10 06:10:39,406 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:39,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:39,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:39,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:10:39,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:10:39,436 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:10:39,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:10:39,437 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9f03261-b82a-4cbb-918c-b55c39a12ebf/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:10:39,442 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 06:10:39,452 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 06:10:39,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:10:39,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:10:39,460 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:10:39,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:10:39,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-10 06:10:39,480 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 06:10:39,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:39,480 INFO L82 PathProgramCache]: Analyzing trace with hash 50733113, now seen corresponding path program 5 times [2018-11-10 06:10:39,480 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:39,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:39,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:39,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:10:39,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:39,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 06:10:39,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-10 06:10:39,511 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. cyclomatic complexity: 9 Second operand 8 states. [2018-11-10 06:10:39,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:10:39,544 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-11-10 06:10:39,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 06:10:39,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 72 transitions. [2018-11-10 06:10:39,546 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-11-10 06:10:39,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 67 states and 71 transitions. [2018-11-10 06:10:39,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-10 06:10:39,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-10 06:10:39,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 71 transitions. [2018-11-10 06:10:39,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:10:39,547 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-10 06:10:39,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 71 transitions. [2018-11-10 06:10:39,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-11-10 06:10:39,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-10 06:10:39,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-11-10 06:10:39,550 INFO L728 BuchiCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-11-10 06:10:39,550 INFO L608 BuchiCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-11-10 06:10:39,550 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 06:10:39,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 70 transitions. [2018-11-10 06:10:39,551 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-11-10 06:10:39,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:10:39,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:10:39,551 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 1, 1, 1, 1] [2018-11-10 06:10:39,552 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 06:10:39,552 INFO L793 eck$LassoCheckResult]: Stem: 1106#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1078#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1079#L23-4 assume true; 1086#L23-1 assume !!(main_~i~1 < 5); 1087#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1107#L24-1 havoc main_#t~nondet3; 1103#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1101#L23-4 assume true; 1102#L23-1 assume !!(main_~i~1 < 5); 1126#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1125#L24-1 havoc main_#t~nondet3; 1124#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1123#L23-4 assume true; 1122#L23-1 assume !!(main_~i~1 < 5); 1121#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1120#L24-1 havoc main_#t~nondet3; 1119#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1118#L23-4 assume true; 1117#L23-1 assume !!(main_~i~1 < 5); 1116#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1115#L24-1 havoc main_#t~nondet3; 1114#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1113#L23-4 assume true; 1109#L23-1 assume !!(main_~i~1 < 5); 1112#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1111#L24-1 havoc main_#t~nondet3; 1110#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1108#L23-4 assume true; 1084#L23-1 assume !(main_~i~1 < 5); 1085#L23-5 assume { :begin_inline_avg } true;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; 1063#L9-4 [2018-11-10 06:10:39,552 INFO L795 eck$LassoCheckResult]: Loop: 1063#L9-4 assume true; 1064#L9-1 assume !!(avg_~i~0 < 5); 1070#L10 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10 1080#L10-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1066#L9-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 1063#L9-4 [2018-11-10 06:10:39,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:39,556 INFO L82 PathProgramCache]: Analyzing trace with hash 975998922, now seen corresponding path program 5 times [2018-11-10 06:10:39,556 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:39,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:39,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:39,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:10:39,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:39,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:39,576 INFO L82 PathProgramCache]: Analyzing trace with hash 50733113, now seen corresponding path program 6 times [2018-11-10 06:10:39,576 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:39,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:39,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:39,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:10:39,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:39,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:39,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1604778480, now seen corresponding path program 1 times [2018-11-10 06:10:39,582 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:39,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:39,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:39,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:10:39,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:39,929 WARN L179 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 113 [2018-11-10 06:10:40,017 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:10:40,017 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:10:40,018 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:10:40,018 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:10:40,018 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:10:40,018 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:10:40,018 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:10:40,018 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:10:40,018 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg05_true-unreach-call_true-termination.i_Iteration7_Lasso [2018-11-10 06:10:40,018 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:10:40,018 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:10:40,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:40,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:40,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:40,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:40,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:40,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:40,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:40,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:40,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:40,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:40,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:40,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:40,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:40,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-10 06:10:40,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:40,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:40,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:40,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-10 06:10:40,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-10 06:10:40,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-10 06:10:40,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:40,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:10:40,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-10 06:10:40,397 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:10:40,398 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:10:40,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:10:40,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:10:40,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:10:40,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:10:40,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:10:40,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:10:40,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:10:40,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:10:40,399 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:10:40,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:10:40,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:10:40,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:10:40,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:10:40,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:10:40,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:10:40,401 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:10:40,402 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:10:40,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:10:40,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:10:40,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:10:40,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:10:40,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:10:40,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:10:40,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:10:40,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:10:40,403 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:10:40,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:10:40,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:10:40,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:10:40,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:10:40,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:10:40,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:10:40,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:10:40,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:10:40,405 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:10:40,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:10:40,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:10:40,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:10:40,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:10:40,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:10:40,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:10:40,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:10:40,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:10:40,406 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:10:40,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:10:40,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:10:40,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:10:40,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:10:40,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:10:40,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:10:40,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:10:40,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:10:40,408 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:10:40,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:10:40,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:10:40,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:10:40,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:10:40,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:10:40,410 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:10:40,410 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:10:40,412 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:10:40,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:10:40,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:10:40,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:10:40,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:10:40,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:10:40,414 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:10:40,414 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:10:40,416 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:10:40,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:10:40,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:10:40,417 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 06:10:40,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:10:40,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:10:40,419 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:10:40,419 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:10:40,425 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:10:40,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:10:40,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:10:40,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:10:40,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:10:40,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:10:40,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:10:40,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:10:40,433 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:10:40,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:10:40,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:10:40,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:10:40,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:10:40,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:10:40,435 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:10:40,435 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:10:40,439 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:10:40,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:10:40,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:10:40,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:10:40,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:10:40,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:10:40,443 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:10:40,443 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:10:40,459 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 06:10:40,478 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 06:10:40,478 INFO L444 ModelExtractionUtils]: 23 out of 31 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-10 06:10:40,478 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 06:10:40,479 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 06:10:40,479 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 06:10:40,479 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_avg_~i~0) = -2*ULTIMATE.start_avg_~i~0 + 9 Supporting invariants [] [2018-11-10 06:10:40,516 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-10 06:10:40,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:40,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:10:40,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:10:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:10:40,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:10:40,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:10:40,560 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 06:10:40,560 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 70 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-10 06:10:40,570 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 70 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 80 states and 85 transitions. Complement of second has 7 states. [2018-11-10 06:10:40,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 06:10:40,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 06:10:40,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-10 06:10:40,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 30 letters. Loop has 5 letters. [2018-11-10 06:10:40,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:10:40,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 35 letters. Loop has 5 letters. [2018-11-10 06:10:40,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:10:40,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 30 letters. Loop has 10 letters. [2018-11-10 06:10:40,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:10:40,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 85 transitions. [2018-11-10 06:10:40,572 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-10 06:10:40,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 68 states and 73 transitions. [2018-11-10 06:10:40,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-11-10 06:10:40,573 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-10 06:10:40,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 73 transitions. [2018-11-10 06:10:40,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:10:40,574 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-11-10 06:10:40,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 73 transitions. [2018-11-10 06:10:40,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-10 06:10:40,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-10 06:10:40,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-11-10 06:10:40,576 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-11-10 06:10:40,576 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-11-10 06:10:40,576 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 06:10:40,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 73 transitions. [2018-11-10 06:10:40,577 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-10 06:10:40,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:10:40,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:10:40,578 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:10:40,578 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 06:10:40,578 INFO L793 eck$LassoCheckResult]: Stem: 1404#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1375#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1376#L23-4 assume true; 1398#L23-1 assume !!(main_~i~1 < 5); 1423#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1422#L24-1 havoc main_#t~nondet3; 1421#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1399#L23-4 assume true; 1383#L23-1 assume !!(main_~i~1 < 5); 1384#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1405#L24-1 havoc main_#t~nondet3; 1400#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1401#L23-4 assume true; 1420#L23-1 assume !!(main_~i~1 < 5); 1419#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1418#L24-1 havoc main_#t~nondet3; 1417#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1416#L23-4 assume true; 1415#L23-1 assume !!(main_~i~1 < 5); 1414#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1413#L24-1 havoc main_#t~nondet3; 1412#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1411#L23-4 assume true; 1407#L23-1 assume !!(main_~i~1 < 5); 1410#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1409#L24-1 havoc main_#t~nondet3; 1408#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1406#L23-4 assume true; 1381#L23-1 assume !(main_~i~1 < 5); 1382#L23-5 assume { :begin_inline_avg } true;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; 1358#L9-4 assume true; 1360#L9-1 assume !(avg_~i~0 < 5); 1366#L9-5 avg_#res := (if (if avg_~ret~0 < 0 && avg_~ret~0 % 5 != 0 then avg_~ret~0 / 5 + 1 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && avg_~ret~0 % 5 != 0 then avg_~ret~0 / 5 + 1 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && avg_~ret~0 % 5 != 0 then avg_~ret~0 / 5 + 1 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 1385#L12 main_#t~ret4 := avg_#res;assume { :end_inline_avg } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4; 1365#L29 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 1364#L29-1 main_~temp~0 := main_#t~mem5;havoc main_#t~mem5; 1362#L29-2 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 1356#L29-3 SUMMARY for call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 1357#L29-4 havoc main_#t~mem6; 1389#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 1386#L29-6 assume { :begin_inline_avg } true;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; 1370#L9-10 [2018-11-10 06:10:40,578 INFO L795 eck$LassoCheckResult]: Loop: 1370#L9-10 assume true; 1371#L9-7 assume !!(avg_~i~0 < 5); 1388#L10-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10-2 1396#L10-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1378#L9-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 1370#L9-10 [2018-11-10 06:10:40,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:40,578 INFO L82 PathProgramCache]: Analyzing trace with hash 177783195, now seen corresponding path program 1 times [2018-11-10 06:10:40,579 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:40,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:40,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:40,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:10:40,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:10:40,605 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 06:10:40,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:10:40,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:10:40,606 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 06:10:40,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:40,606 INFO L82 PathProgramCache]: Analyzing trace with hash 75545043, now seen corresponding path program 1 times [2018-11-10 06:10:40,606 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:40,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:40,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:40,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:10:40,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:40,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:10:40,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:10:40,645 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-10 06:10:40,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:10:40,662 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-10 06:10:40,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:10:40,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 87 transitions. [2018-11-10 06:10:40,664 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-10 06:10:40,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 82 states and 86 transitions. [2018-11-10 06:10:40,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-11-10 06:10:40,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-11-10 06:10:40,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 86 transitions. [2018-11-10 06:10:40,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:10:40,666 INFO L705 BuchiCegarLoop]: Abstraction has 82 states and 86 transitions. [2018-11-10 06:10:40,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 86 transitions. [2018-11-10 06:10:40,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2018-11-10 06:10:40,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 06:10:40,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-11-10 06:10:40,668 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-11-10 06:10:40,668 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-11-10 06:10:40,668 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 06:10:40,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 74 transitions. [2018-11-10 06:10:40,669 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-10 06:10:40,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:10:40,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:10:40,672 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:10:40,672 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 06:10:40,673 INFO L793 eck$LassoCheckResult]: Stem: 1560#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1527#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1528#L23-4 assume true; 1541#L23-1 assume !!(main_~i~1 < 5); 1542#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1562#L24-1 havoc main_#t~nondet3; 1558#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1555#L23-4 assume true; 1556#L23-1 assume !!(main_~i~1 < 5); 1582#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1581#L24-1 havoc main_#t~nondet3; 1580#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1579#L23-4 assume true; 1578#L23-1 assume !!(main_~i~1 < 5); 1577#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1576#L24-1 havoc main_#t~nondet3; 1575#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1574#L23-4 assume true; 1573#L23-1 assume !!(main_~i~1 < 5); 1572#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1571#L24-1 havoc main_#t~nondet3; 1570#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1569#L23-4 assume true; 1564#L23-1 assume !!(main_~i~1 < 5); 1568#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1567#L24-1 havoc main_#t~nondet3; 1566#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1563#L23-4 assume true; 1539#L23-1 assume !(main_~i~1 < 5); 1540#L23-5 assume { :begin_inline_avg } true;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; 1515#L9-4 assume true; 1516#L9-1 assume !!(avg_~i~0 < 5); 1524#L10 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10 1534#L10-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1520#L9-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 1517#L9-4 assume true; 1518#L9-1 assume !(avg_~i~0 < 5); 1523#L9-5 avg_#res := (if (if avg_~ret~0 < 0 && avg_~ret~0 % 5 != 0 then avg_~ret~0 / 5 + 1 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && avg_~ret~0 % 5 != 0 then avg_~ret~0 / 5 + 1 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && avg_~ret~0 % 5 != 0 then avg_~ret~0 / 5 + 1 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 1543#L12 main_#t~ret4 := avg_#res;assume { :end_inline_avg } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4; 1522#L29 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 1521#L29-1 main_~temp~0 := main_#t~mem5;havoc main_#t~mem5; 1519#L29-2 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 1513#L29-3 SUMMARY for call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 1514#L29-4 havoc main_#t~mem6; 1546#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 1544#L29-6 assume { :begin_inline_avg } true;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; 1529#L9-10 assume true; 1530#L9-7 assume !!(avg_~i~0 < 5); 1545#L10-2 [2018-11-10 06:10:40,673 INFO L795 eck$LassoCheckResult]: Loop: 1545#L10-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10-2 1553#L10-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1535#L9-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 1536#L9-10 assume true; 1565#L9-7 assume !!(avg_~i~0 < 5); 1545#L10-2 [2018-11-10 06:10:40,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:40,673 INFO L82 PathProgramCache]: Analyzing trace with hash -967362438, now seen corresponding path program 1 times [2018-11-10 06:10:40,673 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:40,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:40,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:40,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:10:40,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:10:40,704 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 06:10:40,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:10:40,704 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9f03261-b82a-4cbb-918c-b55c39a12ebf/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:10:40,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:10:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:10:40,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:10:40,753 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 06:10:40,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:10:40,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-10 06:10:40,770 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 06:10:40,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:40,771 INFO L82 PathProgramCache]: Analyzing trace with hash 81148413, now seen corresponding path program 2 times [2018-11-10 06:10:40,771 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:40,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:40,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:40,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:10:40,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:40,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 06:10:40,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:10:40,797 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-10 06:10:40,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:10:40,836 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2018-11-10 06:10:40,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 06:10:40,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 102 transitions. [2018-11-10 06:10:40,838 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-10 06:10:40,839 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 97 states and 101 transitions. [2018-11-10 06:10:40,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2018-11-10 06:10:40,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2018-11-10 06:10:40,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 101 transitions. [2018-11-10 06:10:40,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:10:40,840 INFO L705 BuchiCegarLoop]: Abstraction has 97 states and 101 transitions. [2018-11-10 06:10:40,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 101 transitions. [2018-11-10 06:10:40,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 80. [2018-11-10 06:10:40,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-10 06:10:40,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-11-10 06:10:40,843 INFO L728 BuchiCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-11-10 06:10:40,843 INFO L608 BuchiCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-11-10 06:10:40,843 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 06:10:40,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 84 transitions. [2018-11-10 06:10:40,844 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-10 06:10:40,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:10:40,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:10:40,848 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:10:40,848 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 06:10:40,849 INFO L793 eck$LassoCheckResult]: Stem: 1881#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1850#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1851#L23-4 assume true; 1858#L23-1 assume !!(main_~i~1 < 5); 1859#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1882#L24-1 havoc main_#t~nondet3; 1878#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1874#L23-4 assume true; 1875#L23-1 assume !!(main_~i~1 < 5); 1909#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1908#L24-1 havoc main_#t~nondet3; 1907#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1905#L23-4 assume true; 1903#L23-1 assume !!(main_~i~1 < 5); 1901#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1900#L24-1 havoc main_#t~nondet3; 1899#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1898#L23-4 assume true; 1897#L23-1 assume !!(main_~i~1 < 5); 1896#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1895#L24-1 havoc main_#t~nondet3; 1894#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1893#L23-4 assume true; 1886#L23-1 assume !!(main_~i~1 < 5); 1892#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1891#L24-1 havoc main_#t~nondet3; 1889#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1885#L23-4 assume true; 1856#L23-1 assume !(main_~i~1 < 5); 1857#L23-5 assume { :begin_inline_avg } true;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; 1832#L9-4 assume true; 1833#L9-1 assume !!(avg_~i~0 < 5); 1888#L10 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10 1884#L10-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1837#L9-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 1834#L9-4 assume true; 1835#L9-1 assume !!(avg_~i~0 < 5); 1842#L10 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10 1852#L10-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1877#L9-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 1883#L9-4 assume true; 1840#L9-1 assume !(avg_~i~0 < 5); 1841#L9-5 avg_#res := (if (if avg_~ret~0 < 0 && avg_~ret~0 % 5 != 0 then avg_~ret~0 / 5 + 1 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && avg_~ret~0 % 5 != 0 then avg_~ret~0 / 5 + 1 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && avg_~ret~0 % 5 != 0 then avg_~ret~0 / 5 + 1 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 1860#L12 main_#t~ret4 := avg_#res;assume { :end_inline_avg } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4; 1839#L29 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 1838#L29-1 main_~temp~0 := main_#t~mem5;havoc main_#t~mem5; 1836#L29-2 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 1830#L29-3 SUMMARY for call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 1831#L29-4 havoc main_#t~mem6; 1864#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 1861#L29-6 assume { :begin_inline_avg } true;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; 1862#L9-10 assume true; 1906#L9-7 assume !!(avg_~i~0 < 5); 1904#L10-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10-2 1902#L10-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1853#L9-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 1845#L9-10 assume true; 1846#L9-7 assume !!(avg_~i~0 < 5); 1863#L10-2 [2018-11-10 06:10:40,849 INFO L795 eck$LassoCheckResult]: Loop: 1863#L10-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10-2 1871#L10-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1872#L9-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 1890#L9-10 assume true; 1887#L9-7 assume !!(avg_~i~0 < 5); 1863#L10-2 [2018-11-10 06:10:40,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:40,849 INFO L82 PathProgramCache]: Analyzing trace with hash 56115230, now seen corresponding path program 1 times [2018-11-10 06:10:40,849 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:40,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:40,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:40,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:10:40,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:10:40,900 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-10 06:10:40,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:10:40,900 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9f03261-b82a-4cbb-918c-b55c39a12ebf/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:10:40,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:10:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:10:40,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:10:40,957 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-10 06:10:40,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:10:40,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-10 06:10:40,975 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 06:10:40,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:40,975 INFO L82 PathProgramCache]: Analyzing trace with hash 81148413, now seen corresponding path program 3 times [2018-11-10 06:10:40,975 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:40,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:40,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:40,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:10:40,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:41,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 06:10:41,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-10 06:10:41,002 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-11-10 06:10:41,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:10:41,041 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-11-10 06:10:41,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 06:10:41,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 117 transitions. [2018-11-10 06:10:41,043 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-10 06:10:41,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 112 states and 116 transitions. [2018-11-10 06:10:41,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-11-10 06:10:41,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-10 06:10:41,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 116 transitions. [2018-11-10 06:10:41,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:10:41,044 INFO L705 BuchiCegarLoop]: Abstraction has 112 states and 116 transitions. [2018-11-10 06:10:41,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 116 transitions. [2018-11-10 06:10:41,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 90. [2018-11-10 06:10:41,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-10 06:10:41,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2018-11-10 06:10:41,047 INFO L728 BuchiCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-11-10 06:10:41,047 INFO L608 BuchiCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-11-10 06:10:41,047 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 06:10:41,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 94 transitions. [2018-11-10 06:10:41,048 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-10 06:10:41,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:10:41,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:10:41,051 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:10:41,052 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 06:10:41,052 INFO L793 eck$LassoCheckResult]: Stem: 2254#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2219#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2220#L23-4 assume true; 2247#L23-1 assume !!(main_~i~1 < 5); 2281#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2256#L24-1 havoc main_#t~nondet3; 2252#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2248#L23-4 assume true; 2233#L23-1 assume !!(main_~i~1 < 5); 2234#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2257#L24-1 havoc main_#t~nondet3; 2280#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2279#L23-4 assume true; 2278#L23-1 assume !!(main_~i~1 < 5); 2277#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2276#L24-1 havoc main_#t~nondet3; 2275#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2274#L23-4 assume true; 2273#L23-1 assume !!(main_~i~1 < 5); 2272#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2271#L24-1 havoc main_#t~nondet3; 2270#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2269#L23-4 assume true; 2261#L23-1 assume !!(main_~i~1 < 5); 2268#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2266#L24-1 havoc main_#t~nondet3; 2264#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2260#L23-4 assume true; 2231#L23-1 assume !(main_~i~1 < 5); 2232#L23-5 assume { :begin_inline_avg } true;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; 2205#L9-4 assume true; 2206#L9-1 assume !!(avg_~i~0 < 5); 2282#L10 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10 2283#L10-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2210#L9-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 2211#L9-4 assume true; 2284#L9-1 assume !!(avg_~i~0 < 5); 2285#L10 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10 2250#L10-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2251#L9-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 2207#L9-4 assume true; 2208#L9-1 assume !!(avg_~i~0 < 5); 2216#L10 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10 2226#L10-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2259#L9-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 2258#L9-4 assume true; 2214#L9-1 assume !(avg_~i~0 < 5); 2215#L9-5 avg_#res := (if (if avg_~ret~0 < 0 && avg_~ret~0 % 5 != 0 then avg_~ret~0 / 5 + 1 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && avg_~ret~0 % 5 != 0 then avg_~ret~0 / 5 + 1 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && avg_~ret~0 % 5 != 0 then avg_~ret~0 / 5 + 1 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 2235#L12 main_#t~ret4 := avg_#res;assume { :end_inline_avg } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4; 2213#L29 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 2212#L29-1 main_~temp~0 := main_#t~mem5;havoc main_#t~mem5; 2209#L29-2 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 2203#L29-3 SUMMARY for call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 2204#L29-4 havoc main_#t~mem6; 2238#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 2236#L29-6 assume { :begin_inline_avg } true;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; 2221#L9-10 assume true; 2222#L9-7 assume !!(avg_~i~0 < 5); 2237#L10-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10-2 2245#L10-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2227#L9-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 2228#L9-10 assume true; 2292#L9-7 assume !!(avg_~i~0 < 5); 2291#L10-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10-2 2290#L10-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2289#L9-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 2288#L9-10 assume true; 2287#L9-7 assume !!(avg_~i~0 < 5); 2263#L10-2 [2018-11-10 06:10:41,052 INFO L795 eck$LassoCheckResult]: Loop: 2263#L10-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10-2 2286#L10-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2267#L9-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 2265#L9-10 assume true; 2262#L9-7 assume !!(avg_~i~0 < 5); 2263#L10-2 [2018-11-10 06:10:41,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:41,052 INFO L82 PathProgramCache]: Analyzing trace with hash 713846394, now seen corresponding path program 2 times [2018-11-10 06:10:41,052 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:41,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:41,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:41,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:10:41,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:10:41,108 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-10 06:10:41,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:10:41,109 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9f03261-b82a-4cbb-918c-b55c39a12ebf/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:10:41,130 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 06:10:41,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 06:10:41,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:10:41,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:10:41,187 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-10 06:10:41,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:10:41,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-10 06:10:41,205 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 06:10:41,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:41,205 INFO L82 PathProgramCache]: Analyzing trace with hash 81148413, now seen corresponding path program 4 times [2018-11-10 06:10:41,205 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:41,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:41,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:41,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:10:41,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:41,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 06:10:41,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 06:10:41,236 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-11-10 06:10:41,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:10:41,278 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-11-10 06:10:41,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 06:10:41,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 132 transitions. [2018-11-10 06:10:41,279 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-10 06:10:41,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 127 states and 131 transitions. [2018-11-10 06:10:41,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2018-11-10 06:10:41,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2018-11-10 06:10:41,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 131 transitions. [2018-11-10 06:10:41,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:10:41,281 INFO L705 BuchiCegarLoop]: Abstraction has 127 states and 131 transitions. [2018-11-10 06:10:41,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 131 transitions. [2018-11-10 06:10:41,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 100. [2018-11-10 06:10:41,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-10 06:10:41,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2018-11-10 06:10:41,287 INFO L728 BuchiCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-11-10 06:10:41,287 INFO L608 BuchiCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-11-10 06:10:41,287 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 06:10:41,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 104 transitions. [2018-11-10 06:10:41,288 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-10 06:10:41,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:10:41,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:10:41,289 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:10:41,289 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 06:10:41,289 INFO L793 eck$LassoCheckResult]: Stem: 2681#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2652#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2653#L23-4 assume true; 2661#L23-1 assume !!(main_~i~1 < 5); 2662#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2709#L24-1 havoc main_#t~nondet3; 2678#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2675#L23-4 assume true; 2676#L23-1 assume !!(main_~i~1 < 5); 2684#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2682#L24-1 havoc main_#t~nondet3; 2683#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2707#L23-4 assume true; 2706#L23-1 assume !!(main_~i~1 < 5); 2705#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2704#L24-1 havoc main_#t~nondet3; 2703#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2702#L23-4 assume true; 2701#L23-1 assume !!(main_~i~1 < 5); 2700#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2699#L24-1 havoc main_#t~nondet3; 2698#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2697#L23-4 assume true; 2689#L23-1 assume !!(main_~i~1 < 5); 2696#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2694#L24-1 havoc main_#t~nondet3; 2692#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2688#L23-4 assume true; 2659#L23-1 assume !(main_~i~1 < 5); 2660#L23-5 assume { :begin_inline_avg } true;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; 2634#L9-4 assume true; 2635#L9-1 assume !!(avg_~i~0 < 5); 2644#L10 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10 2654#L10-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2639#L9-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 2636#L9-4 assume true; 2637#L9-1 assume !!(avg_~i~0 < 5); 2730#L10 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10 2728#L10-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2726#L9-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 2724#L9-4 assume true; 2722#L9-1 assume !!(avg_~i~0 < 5); 2720#L10 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10 2718#L10-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2716#L9-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 2714#L9-4 assume true; 2686#L9-1 assume !!(avg_~i~0 < 5); 2711#L10 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10 2710#L10-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2687#L9-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 2685#L9-4 assume true; 2642#L9-1 assume !(avg_~i~0 < 5); 2643#L9-5 avg_#res := (if (if avg_~ret~0 < 0 && avg_~ret~0 % 5 != 0 then avg_~ret~0 / 5 + 1 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && avg_~ret~0 % 5 != 0 then avg_~ret~0 / 5 + 1 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && avg_~ret~0 % 5 != 0 then avg_~ret~0 / 5 + 1 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 2663#L12 main_#t~ret4 := avg_#res;assume { :end_inline_avg } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4; 2641#L29 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 2640#L29-1 main_~temp~0 := main_#t~mem5;havoc main_#t~mem5; 2638#L29-2 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 2632#L29-3 SUMMARY for call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 2633#L29-4 havoc main_#t~mem6; 2666#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 2664#L29-6 assume { :begin_inline_avg } true;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; 2647#L9-10 assume true; 2648#L9-7 assume !!(avg_~i~0 < 5); 2665#L10-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10-2 2673#L10-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2655#L9-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 2656#L9-10 assume true; 2731#L9-7 assume !!(avg_~i~0 < 5); 2729#L10-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10-2 2727#L10-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2725#L9-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 2723#L9-10 assume true; 2721#L9-7 assume !!(avg_~i~0 < 5); 2719#L10-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10-2 2717#L10-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2715#L9-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 2713#L9-10 assume true; 2712#L9-7 assume !!(avg_~i~0 < 5); 2691#L10-2 [2018-11-10 06:10:41,289 INFO L795 eck$LassoCheckResult]: Loop: 2691#L10-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10-2 2708#L10-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2695#L9-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 2693#L9-10 assume true; 2690#L9-7 assume !!(avg_~i~0 < 5); 2691#L10-2 [2018-11-10 06:10:41,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:41,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1357089054, now seen corresponding path program 3 times [2018-11-10 06:10:41,290 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:41,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:41,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:41,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:10:41,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:10:41,358 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-10 06:10:41,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:10:41,359 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9f03261-b82a-4cbb-918c-b55c39a12ebf/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:10:41,374 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 06:10:41,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-10 06:10:41,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:10:41,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:10:41,427 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-10 06:10:41,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:10:41,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-10 06:10:41,445 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 06:10:41,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:41,445 INFO L82 PathProgramCache]: Analyzing trace with hash 81148413, now seen corresponding path program 5 times [2018-11-10 06:10:41,445 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:41,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:41,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:41,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:10:41,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:41,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 06:10:41,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-10 06:10:41,485 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. cyclomatic complexity: 9 Second operand 8 states. [2018-11-10 06:10:41,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:10:41,570 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2018-11-10 06:10:41,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 06:10:41,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 138 transitions. [2018-11-10 06:10:41,573 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-10 06:10:41,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 133 states and 137 transitions. [2018-11-10 06:10:41,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2018-11-10 06:10:41,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 [2018-11-10 06:10:41,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 133 states and 137 transitions. [2018-11-10 06:10:41,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:10:41,574 INFO L705 BuchiCegarLoop]: Abstraction has 133 states and 137 transitions. [2018-11-10 06:10:41,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 137 transitions. [2018-11-10 06:10:41,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2018-11-10 06:10:41,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-10 06:10:41,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2018-11-10 06:10:41,581 INFO L728 BuchiCegarLoop]: Abstraction has 110 states and 114 transitions. [2018-11-10 06:10:41,581 INFO L608 BuchiCegarLoop]: Abstraction has 110 states and 114 transitions. [2018-11-10 06:10:41,581 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 06:10:41,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 114 transitions. [2018-11-10 06:10:41,584 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-10 06:10:41,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:10:41,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:10:41,585 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:10:41,585 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 06:10:41,586 INFO L793 eck$LassoCheckResult]: Stem: 3161#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3127#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3128#L23-4 assume true; 3138#L23-1 assume !!(main_~i~1 < 5); 3139#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3199#L24-1 havoc main_#t~nondet3; 3158#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3154#L23-4 assume true; 3155#L23-1 assume !!(main_~i~1 < 5); 3164#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3162#L24-1 havoc main_#t~nondet3; 3163#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3194#L23-4 assume true; 3192#L23-1 assume !!(main_~i~1 < 5); 3190#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3188#L24-1 havoc main_#t~nondet3; 3187#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3186#L23-4 assume true; 3185#L23-1 assume !!(main_~i~1 < 5); 3184#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3183#L24-1 havoc main_#t~nondet3; 3182#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3180#L23-4 assume true; 3171#L23-1 assume !!(main_~i~1 < 5); 3178#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3176#L24-1 havoc main_#t~nondet3; 3174#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3170#L23-4 assume true; 3136#L23-1 assume !(main_~i~1 < 5); 3137#L23-5 assume { :begin_inline_avg } true;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; 3110#L9-4 assume true; 3111#L9-1 assume !!(avg_~i~0 < 5); 3121#L10 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10 3131#L10-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3216#L9-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 3112#L9-4 assume true; 3113#L9-1 assume !!(avg_~i~0 < 5); 3217#L10 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10 3157#L10-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3115#L9-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 3116#L9-4 assume true; 3215#L9-1 assume !!(avg_~i~0 < 5); 3214#L10 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10 3213#L10-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3211#L9-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 3210#L9-4 assume true; 3208#L9-1 assume !!(avg_~i~0 < 5); 3205#L10 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10 3203#L10-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3201#L9-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 3198#L9-4 assume true; 3166#L9-1 assume !!(avg_~i~0 < 5); 3169#L10 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10 3168#L10-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3167#L9-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 3165#L9-4 assume true; 3119#L9-1 assume !(avg_~i~0 < 5); 3120#L9-5 avg_#res := (if (if avg_~ret~0 < 0 && avg_~ret~0 % 5 != 0 then avg_~ret~0 / 5 + 1 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && avg_~ret~0 % 5 != 0 then avg_~ret~0 / 5 + 1 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && avg_~ret~0 % 5 != 0 then avg_~ret~0 / 5 + 1 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 3140#L12 main_#t~ret4 := avg_#res;assume { :end_inline_avg } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4; 3118#L29 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 3117#L29-1 main_~temp~0 := main_#t~mem5;havoc main_#t~mem5; 3114#L29-2 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 3108#L29-3 SUMMARY for call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 3109#L29-4 havoc main_#t~mem6; 3144#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 3141#L29-6 assume { :begin_inline_avg } true;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; 3129#L9-10 assume true; 3130#L9-7 assume !!(avg_~i~0 < 5); 3212#L10-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10-2 3151#L10-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3132#L9-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 3133#L9-10 assume true; 3142#L9-7 assume !!(avg_~i~0 < 5); 3143#L10-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10-2 3153#L10-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3209#L9-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 3207#L9-10 assume true; 3206#L9-7 assume !!(avg_~i~0 < 5); 3204#L10-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10-2 3202#L10-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3200#L9-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 3197#L9-10 assume true; 3196#L9-7 assume !!(avg_~i~0 < 5); 3195#L10-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10-2 3193#L10-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3191#L9-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 3189#L9-10 assume true; 3181#L9-7 assume !!(avg_~i~0 < 5); 3173#L10-2 [2018-11-10 06:10:41,586 INFO L795 eck$LassoCheckResult]: Loop: 3173#L10-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10-2 3179#L10-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3177#L9-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 3175#L9-10 assume true; 3172#L9-7 assume !!(avg_~i~0 < 5); 3173#L10-2 [2018-11-10 06:10:41,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:41,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1334655878, now seen corresponding path program 4 times [2018-11-10 06:10:41,586 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:41,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:41,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:41,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:10:41,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:41,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:41,668 INFO L82 PathProgramCache]: Analyzing trace with hash 81148413, now seen corresponding path program 6 times [2018-11-10 06:10:41,668 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:41,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:41,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:41,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:10:41,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:41,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:41,673 INFO L82 PathProgramCache]: Analyzing trace with hash 267933988, now seen corresponding path program 5 times [2018-11-10 06:10:41,673 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:41,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:41,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:41,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:10:41,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:10:41,793 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 42 proven. 18 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-10 06:10:41,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:10:41,793 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9f03261-b82a-4cbb-918c-b55c39a12ebf/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:10:41,804 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 06:10:41,845 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-10 06:10:41,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:10:41,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:10:41,890 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-10 06:10:41,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 06:10:41,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 14 [2018-11-10 06:10:41,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 06:10:41,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-11-10 06:10:41,938 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. cyclomatic complexity: 9 Second operand 15 states. [2018-11-10 06:10:42,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:10:42,123 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2018-11-10 06:10:42,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 06:10:42,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 134 transitions. [2018-11-10 06:10:42,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 06:10:42,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 103 states and 104 transitions. [2018-11-10 06:10:42,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2018-11-10 06:10:42,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2018-11-10 06:10:42,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 104 transitions. [2018-11-10 06:10:42,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:10:42,126 INFO L705 BuchiCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-11-10 06:10:42,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 104 transitions. [2018-11-10 06:10:42,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-11-10 06:10:42,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-10 06:10:42,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-11-10 06:10:42,129 INFO L728 BuchiCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-11-10 06:10:42,130 INFO L608 BuchiCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-11-10 06:10:42,130 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 06:10:42,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 104 transitions. [2018-11-10 06:10:42,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 06:10:42,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:10:42,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:10:42,131 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:10:42,131 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 06:10:42,132 INFO L793 eck$LassoCheckResult]: Stem: 3706#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3681#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3682#L23-4 assume true; 3699#L23-1 assume !!(main_~i~1 < 5); 3767#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3766#L24-1 havoc main_#t~nondet3; 3765#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3700#L23-4 assume true; 3690#L23-1 assume !!(main_~i~1 < 5); 3691#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3707#L24-1 havoc main_#t~nondet3; 3702#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3703#L23-4 assume true; 3764#L23-1 assume !!(main_~i~1 < 5); 3763#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3762#L24-1 havoc main_#t~nondet3; 3761#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3760#L23-4 assume true; 3759#L23-1 assume !!(main_~i~1 < 5); 3758#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3757#L24-1 havoc main_#t~nondet3; 3756#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3755#L23-4 assume true; 3751#L23-1 assume !!(main_~i~1 < 5); 3754#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3753#L24-1 havoc main_#t~nondet3; 3752#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3750#L23-4 assume true; 3688#L23-1 assume !(main_~i~1 < 5); 3689#L23-5 assume { :begin_inline_avg } true;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; 3667#L9-4 assume true; 3668#L9-1 assume !!(avg_~i~0 < 5); 3674#L10 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10 3683#L10-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3670#L9-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 3671#L9-4 assume true; 3749#L9-1 assume !!(avg_~i~0 < 5); 3748#L10 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10 3747#L10-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3746#L9-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 3745#L9-4 assume true; 3743#L9-1 assume !!(avg_~i~0 < 5); 3741#L10 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10 3739#L10-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3737#L9-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 3735#L9-4 assume true; 3733#L9-1 assume !!(avg_~i~0 < 5); 3731#L10 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10 3729#L10-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3727#L9-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 3725#L9-4 assume true; 3723#L9-1 assume !!(avg_~i~0 < 5); 3721#L10 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10 3719#L10-1 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3717#L9-3 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 3715#L9-4 assume true; 3713#L9-1 assume !(avg_~i~0 < 5); 3696#L9-5 avg_#res := (if (if avg_~ret~0 < 0 && avg_~ret~0 % 5 != 0 then avg_~ret~0 / 5 + 1 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && avg_~ret~0 % 5 != 0 then avg_~ret~0 / 5 + 1 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && avg_~ret~0 % 5 != 0 then avg_~ret~0 / 5 + 1 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 3692#L12 main_#t~ret4 := avg_#res;assume { :end_inline_avg } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4; 3673#L29 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 3672#L29-1 main_~temp~0 := main_#t~mem5;havoc main_#t~mem5; 3669#L29-2 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 3665#L29-3 SUMMARY for call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 3666#L29-4 havoc main_#t~mem6; 3695#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 3693#L29-6 assume { :begin_inline_avg } true;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; 3677#L9-10 assume true; 3678#L9-7 assume !!(avg_~i~0 < 5); 3694#L10-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10-2 3697#L10-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3684#L9-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 3685#L9-10 assume true; 3744#L9-7 assume !!(avg_~i~0 < 5); 3742#L10-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10-2 3740#L10-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3738#L9-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 3736#L9-10 assume true; 3734#L9-7 assume !!(avg_~i~0 < 5); 3732#L10-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10-2 3730#L10-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3728#L9-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 3726#L9-10 assume true; 3724#L9-7 assume !!(avg_~i~0 < 5); 3722#L10-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10-2 3720#L10-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3718#L9-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 3716#L9-10 assume true; 3714#L9-7 assume !!(avg_~i~0 < 5); 3712#L10-2 SUMMARY for call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + avg_~i~0 * 4, 4); srcloc: L10-2 3711#L10-3 avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3710#L9-9 avg_#t~post0 := avg_~i~0;avg_~i~0 := avg_#t~post0 + 1;havoc avg_#t~post0; 3709#L9-10 assume true; 3708#L9-7 assume !(avg_~i~0 < 5); 3701#L9-11 avg_#res := (if (if avg_~ret~0 < 0 && avg_~ret~0 % 5 != 0 then avg_~ret~0 / 5 + 1 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && avg_~ret~0 % 5 != 0 then avg_~ret~0 / 5 + 1 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && avg_~ret~0 % 5 != 0 then avg_~ret~0 / 5 + 1 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 3686#L12-1 main_#t~ret7 := avg_#res;assume { :end_inline_avg } true;main_~ret2~0 := main_#t~ret7;havoc main_#t~ret7; 3687#L31 SUMMARY for call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L31 3675#L31-1 main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;main_~i~2 := 0; 3676#L32-4 [2018-11-10 06:10:42,132 INFO L795 eck$LassoCheckResult]: Loop: 3676#L32-4 assume true; 3679#L32-1 assume !!(main_~i~2 < 4); 3680#L33 SUMMARY for call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset + (main_~i~2 + 1) * 4, 4); srcloc: L33 3705#L33-1 SUMMARY for call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset + main_~i~2 * 4, 4); srcloc: L33-1 3704#L33-2 havoc main_#t~mem10; 3698#L32-3 main_#t~post9 := main_~i~2;main_~i~2 := main_#t~post9 + 1;havoc main_#t~post9; 3676#L32-4 [2018-11-10 06:10:42,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:42,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1008738181, now seen corresponding path program 1 times [2018-11-10 06:10:42,132 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:42,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:42,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:42,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:10:42,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:42,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:42,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1331818359, now seen corresponding path program 1 times [2018-11-10 06:10:42,239 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:42,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:42,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:42,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:10:42,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:42,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:10:42,244 INFO L82 PathProgramCache]: Analyzing trace with hash 2090958093, now seen corresponding path program 1 times [2018-11-10 06:10:42,244 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:10:42,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:10:42,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:42,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:10:42,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:10:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:10:45,208 WARN L179 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 375 DAG size of output: 302 [2018-11-10 06:12:04,944 WARN L179 SmtUtils]: Spent 1.32 m on a formula simplification. DAG size of input: 236 DAG size of output: 164 [2018-11-10 06:12:04,946 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:12:04,946 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:12:04,946 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:12:04,946 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:12:04,947 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:12:04,947 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:12:04,947 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:12:04,947 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:12:04,947 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg05_true-unreach-call_true-termination.i_Iteration14_Lasso [2018-11-10 06:12:04,947 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:12:04,947 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:12:04,949 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 06:12:05,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:12:05,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:12:05,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:12:05,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:12:05,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:12:05,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:12:05,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:12:05,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:12:05,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:12:05,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:12:05,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:12:05,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:12:05,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:12:05,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:12:05,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:12:05,585 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 110 [2018-11-10 06:12:13,502 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 7049 conjuctions. This might take some time... [2018-11-10 06:12:13,568 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 6 conjuctions. [2018-11-10 06:12:15,024 WARN L179 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 161 DAG size of output: 135 [2018-11-10 06:12:15,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:12:15,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:12:15,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:12:15,149 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 06:12:16,607 WARN L179 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 246 DAG size of output: 142 [2018-11-10 06:12:16,625 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 06:12:18,955 WARN L179 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 209 DAG size of output: 128 [2018-11-10 06:12:18,979 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:12:18,979 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:12:18,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:12:18,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:12:18,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:12:18,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:12:18,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:12:18,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:12:18,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:12:18,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:12:18,988 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:12:18,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:12:18,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:12:18,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:12:18,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:12:18,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:12:18,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:12:18,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:12:18,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:12:18,990 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:12:18,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:12:18,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:12:18,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:12:18,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:12:18,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:12:18,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:12:18,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:12:18,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:12:18,992 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:12:18,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:12:18,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:12:18,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:12:18,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:12:18,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:12:18,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:12:18,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:12:18,995 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:12:18,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:12:18,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:12:18,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:12:18,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:12:18,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:12:18,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:12:18,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:12:18,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:12:18,996 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:12:18,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:12:18,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:12:18,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:12:18,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:12:18,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:12:18,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:12:18,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:12:18,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:12:18,998 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:12:18,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:12:18,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:12:18,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:12:18,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:12:18,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:12:18,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:12:19,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:12:19,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:12:19,000 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:12:19,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:12:19,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:12:19,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:12:19,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:12:19,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:12:19,002 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:12:19,002 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:12:19,003 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:12:19,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:12:19,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:12:19,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:12:19,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:12:19,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:12:19,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:12:19,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:12:19,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:12:19,005 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:12:19,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:12:19,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:12:19,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:12:19,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:12:19,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:12:19,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:12:19,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:12:19,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:12:19,006 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:12:19,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:12:19,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:12:19,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:12:19,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:12:19,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:12:19,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:12:19,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:12:19,009 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:12:19,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:12:19,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:12:19,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:12:19,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:12:19,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:12:19,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:12:19,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:12:19,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:12:19,011 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:12:19,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:12:19,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:12:19,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:12:19,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:12:19,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:12:19,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:12:19,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:12:19,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:12:19,013 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:12:19,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:12:19,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:12:19,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:12:19,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:12:19,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:12:19,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:12:19,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:12:19,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:12:19,015 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:12:19,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:12:19,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:12:19,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:12:19,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:12:19,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:12:19,017 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:12:19,017 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:12:19,021 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:12:19,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:12:19,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:12:19,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:12:19,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:12:19,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:12:19,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:12:19,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:12:19,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:12:19,023 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:12:19,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:12:19,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:12:19,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:12:19,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:12:19,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:12:19,090 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:12:19,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:12:19,099 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 06:12:19,111 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 06:12:19,111 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 06:12:19,111 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 06:12:19,112 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 06:12:19,112 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 06:12:19,113 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2) = -2*ULTIMATE.start_main_~i~2 + 7 Supporting invariants [] [2018-11-10 06:12:19,354 INFO L297 tatePredicateManager]: 48 out of 48 supporting invariants were superfluous and have been removed [2018-11-10 06:12:19,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:12:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:12:19,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:12:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:12:19,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:12:19,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:12:19,414 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 06:12:19,414 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 103 states and 104 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-10 06:12:19,428 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 103 states and 104 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 109 states and 111 transitions. Complement of second has 6 states. [2018-11-10 06:12:19,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 06:12:19,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 06:12:19,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2018-11-10 06:12:19,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 97 letters. Loop has 6 letters. [2018-11-10 06:12:19,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:12:19,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 103 letters. Loop has 6 letters. [2018-11-10 06:12:19,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:12:19,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 97 letters. Loop has 12 letters. [2018-11-10 06:12:19,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:12:19,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 111 transitions. [2018-11-10 06:12:19,432 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 06:12:19,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 0 states and 0 transitions. [2018-11-10 06:12:19,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 06:12:19,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 06:12:19,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 06:12:19,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:12:19,433 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:12:19,433 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:12:19,433 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:12:19,433 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 06:12:19,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 06:12:19,433 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 06:12:19,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 06:12:19,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 06:12:19 BoogieIcfgContainer [2018-11-10 06:12:19,439 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 06:12:19,440 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 06:12:19,440 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 06:12:19,440 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 06:12:19,440 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:10:37" (3/4) ... [2018-11-10 06:12:19,444 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 06:12:19,444 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 06:12:19,444 INFO L168 Benchmark]: Toolchain (without parser) took 102225.69 ms. Allocated memory was 1.0 GB in the beginning and 3.4 GB in the end (delta: 2.4 GB). Free memory was 957.1 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 589.2 MB. Max. memory is 11.5 GB. [2018-11-10 06:12:19,445 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:12:19,446 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.45 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 06:12:19,446 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.36 ms. Allocated memory is still 1.0 GB. Free memory was 946.4 MB in the beginning and 941.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 06:12:19,446 INFO L168 Benchmark]: Boogie Preprocessor took 23.03 ms. Allocated memory is still 1.0 GB. Free memory is still 941.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:12:19,447 INFO L168 Benchmark]: RCFGBuilder took 286.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-11-10 06:12:19,447 INFO L168 Benchmark]: BuchiAutomizer took 101713.37 ms. Allocated memory was 1.2 GB in the beginning and 3.4 GB in the end (delta: 2.2 GB). Free memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 604.4 MB. Max. memory is 11.5 GB. [2018-11-10 06:12:19,448 INFO L168 Benchmark]: Witness Printer took 4.08 ms. Allocated memory is still 3.4 GB. Free memory is still 2.7 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:12:19,450 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 160.45 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.36 ms. Allocated memory is still 1.0 GB. Free memory was 946.4 MB in the beginning and 941.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.03 ms. Allocated memory is still 1.0 GB. Free memory is still 941.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 286.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 101713.37 ms. Allocated memory was 1.2 GB in the beginning and 3.4 GB in the end (delta: 2.2 GB). Free memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 604.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.08 ms. Allocated memory is still 3.4 GB. Free memory is still 2.7 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (11 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 9 * unknown-#length-unknown[x] + -8 * i and consists of 6 locations. One deterministic module has affine ranking function -2 * i + 9 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 7 and consists of 4 locations. 11 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 101.6s and 15 iterations. TraceHistogramMax:6. Analysis of lassos took 100.6s. Construction of modules took 0.3s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 13. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 118 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 110 states and ocurred in iteration 12. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 562 SDtfs, 652 SDslu, 1251 SDs, 0 SdLazy, 500 SolverSat, 102 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU10 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital1879 mio100 ax100 hnf99 lsp444 ukn60 mio100 lsp178 div81 bol100 ite100 ukn100 eq168 hnf90 smp68 dnf1248 smp68 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 4 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...