./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_74ccbd08-2ae1-47d7-a811-18c7abe9ca2d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_74ccbd08-2ae1-47d7-a811-18c7abe9ca2d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_74ccbd08-2ae1-47d7-a811-18c7abe9ca2d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_74ccbd08-2ae1-47d7-a811-18c7abe9ca2d/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_74ccbd08-2ae1-47d7-a811-18c7abe9ca2d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_74ccbd08-2ae1-47d7-a811-18c7abe9ca2d/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-635dfa2 [2018-12-02 17:07:40,545 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 17:07:40,546 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 17:07:40,555 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 17:07:40,555 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 17:07:40,556 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 17:07:40,557 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 17:07:40,557 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 17:07:40,558 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 17:07:40,559 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 17:07:40,559 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 17:07:40,560 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 17:07:40,560 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 17:07:40,561 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 17:07:40,561 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 17:07:40,562 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 17:07:40,562 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 17:07:40,563 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 17:07:40,564 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 17:07:40,565 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 17:07:40,566 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 17:07:40,567 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 17:07:40,568 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 17:07:40,568 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 17:07:40,568 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 17:07:40,569 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 17:07:40,569 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 17:07:40,570 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 17:07:40,570 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 17:07:40,571 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 17:07:40,571 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 17:07:40,571 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 17:07:40,571 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 17:07:40,572 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 17:07:40,572 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 17:07:40,573 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 17:07:40,573 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_74ccbd08-2ae1-47d7-a811-18c7abe9ca2d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 17:07:40,581 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 17:07:40,581 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 17:07:40,582 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 17:07:40,583 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 17:07:40,583 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 17:07:40,583 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 17:07:40,583 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 17:07:40,583 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 17:07:40,583 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 17:07:40,583 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 17:07:40,584 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 17:07:40,584 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 17:07:40,584 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 17:07:40,584 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 17:07:40,584 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 17:07:40,584 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 17:07:40,585 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 17:07:40,585 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 17:07:40,585 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 17:07:40,585 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 17:07:40,585 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 17:07:40,585 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 17:07:40,585 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 17:07:40,586 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 17:07:40,586 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 17:07:40,586 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 17:07:40,586 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 17:07:40,586 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 17:07:40,586 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 17:07:40,586 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 17:07:40,587 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 17:07:40,587 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 17:07:40,588 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_74ccbd08-2ae1-47d7-a811-18c7abe9ca2d/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-12-02 17:07:40,611 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 17:07:40,621 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 17:07:40,623 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 17:07:40,624 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 17:07:40,625 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 17:07:40,625 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_74ccbd08-2ae1-47d7-a811-18c7abe9ca2d/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/avg05_true-unreach-call_true-termination.i [2018-12-02 17:07:40,672 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_74ccbd08-2ae1-47d7-a811-18c7abe9ca2d/bin-2019/uautomizer/data/557c65054/abe377dde17244adbb98d24dc48e79f5/FLAG644479a9c [2018-12-02 17:07:41,093 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 17:07:41,094 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_74ccbd08-2ae1-47d7-a811-18c7abe9ca2d/sv-benchmarks/c/reducercommutativity/avg05_true-unreach-call_true-termination.i [2018-12-02 17:07:41,097 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_74ccbd08-2ae1-47d7-a811-18c7abe9ca2d/bin-2019/uautomizer/data/557c65054/abe377dde17244adbb98d24dc48e79f5/FLAG644479a9c [2018-12-02 17:07:41,105 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_74ccbd08-2ae1-47d7-a811-18c7abe9ca2d/bin-2019/uautomizer/data/557c65054/abe377dde17244adbb98d24dc48e79f5 [2018-12-02 17:07:41,107 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 17:07:41,107 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 17:07:41,108 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 17:07:41,108 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 17:07:41,110 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 17:07:41,110 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:07:41" (1/1) ... [2018-12-02 17:07:41,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@409ee820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:41, skipping insertion in model container [2018-12-02 17:07:41,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:07:41" (1/1) ... [2018-12-02 17:07:41,117 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 17:07:41,125 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 17:07:41,220 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 17:07:41,226 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 17:07:41,238 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 17:07:41,246 INFO L195 MainTranslator]: Completed translation [2018-12-02 17:07:41,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:41 WrapperNode [2018-12-02 17:07:41,247 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 17:07:41,247 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 17:07:41,247 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 17:07:41,247 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 17:07:41,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:41" (1/1) ... [2018-12-02 17:07:41,261 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:41" (1/1) ... [2018-12-02 17:07:41,308 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 17:07:41,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 17:07:41,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 17:07:41,308 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 17:07:41,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:41" (1/1) ... [2018-12-02 17:07:41,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:41" (1/1) ... [2018-12-02 17:07:41,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:41" (1/1) ... [2018-12-02 17:07:41,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:41" (1/1) ... [2018-12-02 17:07:41,319 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:41" (1/1) ... [2018-12-02 17:07:41,322 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:41" (1/1) ... [2018-12-02 17:07:41,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:41" (1/1) ... [2018-12-02 17:07:41,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 17:07:41,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 17:07:41,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 17:07:41,324 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 17:07:41,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ccbd08-2ae1-47d7-a811-18c7abe9ca2d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 17:07:41,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 17:07:41,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 17:07:41,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 17:07:41,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 17:07:41,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 17:07:41,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 17:07:41,495 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 17:07:41,495 INFO L280 CfgBuilder]: Removed 15 assue(true) statements. [2018-12-02 17:07:41,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:07:41 BoogieIcfgContainer [2018-12-02 17:07:41,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 17:07:41,496 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 17:07:41,496 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 17:07:41,498 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 17:07:41,499 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 17:07:41,499 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 05:07:41" (1/3) ... [2018-12-02 17:07:41,499 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6566dda6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 05:07:41, skipping insertion in model container [2018-12-02 17:07:41,500 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 17:07:41,500 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:41" (2/3) ... [2018-12-02 17:07:41,500 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6566dda6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 05:07:41, skipping insertion in model container [2018-12-02 17:07:41,500 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 17:07:41,500 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:07:41" (3/3) ... [2018-12-02 17:07:41,501 INFO L375 chiAutomizerObserver]: Analyzing ICFG avg05_true-unreach-call_true-termination.i [2018-12-02 17:07:41,533 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 17:07:41,534 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 17:07:41,534 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 17:07:41,534 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 17:07:41,534 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 17:07:41,534 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 17:07:41,534 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 17:07:41,534 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 17:07:41,534 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 17:07:41,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-12-02 17:07:41,557 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-12-02 17:07:41,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:07:41,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:07:41,562 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 17:07:41,562 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:07:41,562 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 17:07:41,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-12-02 17:07:41,563 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-12-02 17:07:41,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:07:41,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:07:41,563 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 17:07:41,564 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:07:41,568 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true 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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 26#L23-3true [2018-12-02 17:07:41,568 INFO L796 eck$LassoCheckResult]: Loop: 26#L23-3true assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 9#L23-2true main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 26#L23-3true [2018-12-02 17:07:41,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:41,572 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-02 17:07:41,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:41,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:41,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:41,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:41,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:41,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:41,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-12-02 17:07:41,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:41,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:41,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:41,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:41,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:41,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:41,648 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-12-02 17:07:41,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:41,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:41,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:41,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:41,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:41,730 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 17:07:41,731 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 17:07:41,731 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 17:07:41,731 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 17:07:41,731 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 17:07:41,731 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 17:07:41,731 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 17:07:41,731 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 17:07:41,731 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg05_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-12-02 17:07:41,732 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 17:07:41,732 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 17:07:41,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:41,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:41,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:41,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:41,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:41,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:41,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:41,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:41,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:41,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:41,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:41,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:41,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:41,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:41,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:41,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:41,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:41,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:41,889 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 17:07:41,892 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 17:07:41,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:41,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:41,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:07:41,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:41,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:41,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:41,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:07:41,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:07:41,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:41,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:41,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:41,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:07:41,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:41,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:41,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:41,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:07:41,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:07:41,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:41,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:41,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:41,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:07:41,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:41,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:41,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:41,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:07:41,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:07:41,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:41,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:41,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:41,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:07:41,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:41,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:41,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:41,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:07:41,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:07:41,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:41,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:41,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:41,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:41,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:41,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:41,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:07:41,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:07:41,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:41,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:41,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:41,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:07:41,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:41,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:41,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:41,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:07:41,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:07:41,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:41,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:41,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:41,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:07:41,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:41,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:41,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:41,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:07:41,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:07:41,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:41,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:41,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:41,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:07:41,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:41,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:41,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:41,916 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:07:41,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:07:41,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:41,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:41,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:41,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:07:41,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:41,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:41,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:41,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:07:41,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:07:41,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:41,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:41,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:41,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:41,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:41,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:41,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:07:41,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:07:41,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:41,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:41,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:41,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:07:41,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:41,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:41,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:41,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:07:41,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:07:41,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:41,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:41,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:41,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:07:41,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:41,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:41,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:41,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:07:41,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:07:41,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:41,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:41,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:41,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:07:41,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:41,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:41,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:41,928 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:07:41,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:07:41,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:41,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:41,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:41,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:07:41,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:41,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:41,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:41,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:07:41,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:07:41,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:41,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:41,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:41,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:07:41,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:41,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:41,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:41,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:07:41,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:07:41,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:41,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:41,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:41,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:07:41,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:41,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:41,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:41,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:07:41,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:07:41,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:41,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:41,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:41,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:07:41,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:41,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:41,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:41,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:07:41,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:07:41,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:41,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:41,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:41,937 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 17:07:41,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:41,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:41,938 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 17:07:41,938 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:07:41,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:41,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:41,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:41,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:07:41,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:41,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:41,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:41,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:07:41,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:07:41,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:41,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:41,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:41,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:41,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:41,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:41,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:07:41,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:07:41,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:41,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:41,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:41,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:07:41,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:41,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:41,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:41,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:07:41,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:07:41,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:41,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:41,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:41,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:41,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:41,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:41,950 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:07:41,950 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:07:41,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:41,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:41,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:41,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:41,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:41,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:41,958 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:07:41,958 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:07:41,972 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 17:07:41,985 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 17:07:41,985 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 17:07:41,987 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 17:07:41,988 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 17:07:41,988 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 17:07:41,988 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1) = -2*ULTIMATE.start_main_~i~1 + 9 Supporting invariants [] [2018-12-02 17:07:41,991 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-12-02 17:07:42,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:42,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:07:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:42,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:07:42,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:07:42,049 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 17:07:42,050 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 3 states. [2018-12-02 17:07:42,080 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 3 states. Result 69 states and 95 transitions. Complement of second has 7 states. [2018-12-02 17:07:42,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 17:07:42,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 17:07:42,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-12-02 17:07:42,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 2 letters. Loop has 2 letters. [2018-12-02 17:07:42,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:07:42,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 4 letters. Loop has 2 letters. [2018-12-02 17:07:42,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:07:42,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 2 letters. Loop has 4 letters. [2018-12-02 17:07:42,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:07:42,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 95 transitions. [2018-12-02 17:07:42,087 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:07:42,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 19 states and 24 transitions. [2018-12-02 17:07:42,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-02 17:07:42,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 17:07:42,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2018-12-02 17:07:42,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:07:42,092 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-02 17:07:42,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2018-12-02 17:07:42,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-02 17:07:42,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-02 17:07:42,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-12-02 17:07:42,108 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-02 17:07:42,109 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-02 17:07:42,109 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 17:07:42,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-12-02 17:07:42,109 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:07:42,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:07:42,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:07:42,110 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 17:07:42,110 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:07:42,110 INFO L794 eck$LassoCheckResult]: Stem: 153#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 150#L-1 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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 147#L23-3 assume !(main_~i~1 < 5); 146#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 139#L9-3 [2018-12-02 17:07:42,110 INFO L796 eck$LassoCheckResult]: Loop: 139#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 140#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 139#L9-3 [2018-12-02 17:07:42,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:42,110 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2018-12-02 17:07:42,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:42,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:42,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:42,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:42,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:42,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:07:42,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:07:42,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:07:42,133 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:07:42,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:42,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2018-12-02 17:07:42,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:42,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:42,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:42,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:42,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:42,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:07:42,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:07:42,162 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-02 17:07:42,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:42,170 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-12-02 17:07:42,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:07:42,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2018-12-02 17:07:42,171 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:07:42,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2018-12-02 17:07:42,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 17:07:42,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 17:07:42,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2018-12-02 17:07:42,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:07:42,172 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-12-02 17:07:42,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2018-12-02 17:07:42,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-12-02 17:07:42,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-02 17:07:42,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-12-02 17:07:42,174 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-12-02 17:07:42,174 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-12-02 17:07:42,174 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 17:07:42,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2018-12-02 17:07:42,174 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:07:42,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:07:42,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:07:42,175 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-02 17:07:42,175 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:07:42,175 INFO L794 eck$LassoCheckResult]: Stem: 196#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 195#L-1 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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 192#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 193#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 194#L23-3 assume !(main_~i~1 < 5); 191#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 184#L9-3 [2018-12-02 17:07:42,175 INFO L796 eck$LassoCheckResult]: Loop: 184#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 185#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 184#L9-3 [2018-12-02 17:07:42,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:42,176 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2018-12-02 17:07:42,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:42,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:42,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:42,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:42,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:42,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:07:42,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:07:42,198 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ccbd08-2ae1-47d7-a811-18c7abe9ca2d/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-12-02 17:07:42,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:42,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:07:42,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:07:42,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:07:42,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-02 17:07:42,237 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:07:42,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:42,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2018-12-02 17:07:42,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:42,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:42,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:42,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:42,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:42,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:07:42,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:07:42,263 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-12-02 17:07:42,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:42,274 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2018-12-02 17:07:42,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:07:42,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2018-12-02 17:07:42,275 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:07:42,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 26 transitions. [2018-12-02 17:07:42,275 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 17:07:42,275 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 17:07:42,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2018-12-02 17:07:42,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:07:42,275 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-12-02 17:07:42,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2018-12-02 17:07:42,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-12-02 17:07:42,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 17:07:42,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-12-02 17:07:42,277 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-02 17:07:42,277 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-02 17:07:42,277 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 17:07:42,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2018-12-02 17:07:42,277 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:07:42,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:07:42,277 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:07:42,278 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2018-12-02 17:07:42,278 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:07:42,278 INFO L794 eck$LassoCheckResult]: Stem: 261#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 260#L-1 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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 256#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 257#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 258#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 259#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 266#L23-3 assume !(main_~i~1 < 5); 255#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 248#L9-3 [2018-12-02 17:07:42,278 INFO L796 eck$LassoCheckResult]: Loop: 248#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 249#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 248#L9-3 [2018-12-02 17:07:42,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:42,278 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2018-12-02 17:07:42,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:42,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:42,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:42,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:07:42,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:42,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:07:42,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:07:42,295 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ccbd08-2ae1-47d7-a811-18c7abe9ca2d/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-12-02 17:07:42,301 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 17:07:42,310 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 17:07:42,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 17:07:42,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:07:42,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:07:42,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:07:42,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-02 17:07:42,331 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:07:42,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:42,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2018-12-02 17:07:42,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:42,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:42,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:42,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:07:42,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:42,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:07:42,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:07:42,361 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-12-02 17:07:42,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:42,376 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-12-02 17:07:42,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 17:07:42,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2018-12-02 17:07:42,377 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:07:42,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2018-12-02 17:07:42,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 17:07:42,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 17:07:42,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2018-12-02 17:07:42,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:07:42,379 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-12-02 17:07:42,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2018-12-02 17:07:42,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-12-02 17:07:42,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 17:07:42,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-12-02 17:07:42,380 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-12-02 17:07:42,381 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-12-02 17:07:42,381 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 17:07:42,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-12-02 17:07:42,381 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:07:42,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:07:42,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:07:42,382 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2018-12-02 17:07:42,382 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:07:42,382 INFO L794 eck$LassoCheckResult]: Stem: 336#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 335#L-1 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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 331#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 332#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 333#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 334#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 343#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 342#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 341#L23-3 assume !(main_~i~1 < 5); 330#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 323#L9-3 [2018-12-02 17:07:42,382 INFO L796 eck$LassoCheckResult]: Loop: 323#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 324#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 323#L9-3 [2018-12-02 17:07:42,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:42,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2018-12-02 17:07:42,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:42,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:42,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:42,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:07:42,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:42,410 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:07:42,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:07:42,410 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ccbd08-2ae1-47d7-a811-18c7abe9ca2d/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-12-02 17:07:42,416 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 17:07:42,425 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-02 17:07:42,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 17:07:42,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:07:42,434 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:07:42,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:07:42,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-12-02 17:07:42,448 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:07:42,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:42,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2018-12-02 17:07:42,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:42,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:42,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:42,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:07:42,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:42,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 17:07:42,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:07:42,472 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-12-02 17:07:42,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:42,484 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-12-02 17:07:42,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 17:07:42,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2018-12-02 17:07:42,485 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:07:42,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 30 transitions. [2018-12-02 17:07:42,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 17:07:42,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 17:07:42,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2018-12-02 17:07:42,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:07:42,486 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-12-02 17:07:42,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2018-12-02 17:07:42,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-12-02 17:07:42,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-02 17:07:42,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-12-02 17:07:42,487 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-12-02 17:07:42,487 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-12-02 17:07:42,487 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 17:07:42,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2018-12-02 17:07:42,487 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:07:42,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:07:42,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:07:42,488 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2018-12-02 17:07:42,488 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:07:42,488 INFO L794 eck$LassoCheckResult]: Stem: 425#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 421#L-1 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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 417#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 418#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 419#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 420#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 422#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 431#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 430#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 429#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 428#L23-3 assume !(main_~i~1 < 5); 416#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 409#L9-3 [2018-12-02 17:07:42,488 INFO L796 eck$LassoCheckResult]: Loop: 409#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 410#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 409#L9-3 [2018-12-02 17:07:42,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:42,488 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2018-12-02 17:07:42,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:42,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:42,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:42,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:07:42,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:42,518 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:07:42,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:07:42,518 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ccbd08-2ae1-47d7-a811-18c7abe9ca2d/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-12-02 17:07:42,524 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 17:07:42,533 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 17:07:42,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 17:07:42,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:07:42,544 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:07:42,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:07:42,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-02 17:07:42,559 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:07:42,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:42,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2018-12-02 17:07:42,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:42,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:42,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:42,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:07:42,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:42,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 17:07:42,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 17:07:42,590 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 9 Second operand 8 states. [2018-12-02 17:07:42,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:42,609 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-12-02 17:07:42,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 17:07:42,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2018-12-02 17:07:42,610 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:07:42,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 31 transitions. [2018-12-02 17:07:42,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 17:07:42,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 17:07:42,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2018-12-02 17:07:42,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:07:42,611 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-12-02 17:07:42,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2018-12-02 17:07:42,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-02 17:07:42,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-02 17:07:42,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-12-02 17:07:42,612 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-12-02 17:07:42,612 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-12-02 17:07:42,612 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 17:07:42,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-12-02 17:07:42,613 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:07:42,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:07:42,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:07:42,613 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2018-12-02 17:07:42,613 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:07:42,613 INFO L794 eck$LassoCheckResult]: Stem: 519#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 517#L-1 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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 513#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 514#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 515#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 516#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 518#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 529#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 528#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 527#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 526#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 525#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 524#L23-3 assume !(main_~i~1 < 5); 512#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 505#L9-3 [2018-12-02 17:07:42,614 INFO L796 eck$LassoCheckResult]: Loop: 505#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 506#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 505#L9-3 [2018-12-02 17:07:42,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:42,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2018-12-02 17:07:42,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:42,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:42,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:42,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:07:42,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:42,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:42,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 6 times [2018-12-02 17:07:42,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:42,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:42,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:42,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:07:42,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:42,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:42,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425495, now seen corresponding path program 1 times [2018-12-02 17:07:42,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:42,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:42,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:42,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:07:42,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:42,956 WARN L180 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 100 [2018-12-02 17:07:43,000 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 17:07:43,000 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 17:07:43,000 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 17:07:43,000 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 17:07:43,000 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 17:07:43,000 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 17:07:43,000 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 17:07:43,000 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 17:07:43,000 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg05_true-unreach-call_true-termination.i_Iteration7_Lasso [2018-12-02 17:07:43,000 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 17:07:43,000 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 17:07:43,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:43,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:43,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:43,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:43,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:43,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:43,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:43,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:43,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:43,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:43,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:43,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:43,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:43,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:43,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:43,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:43,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:43,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:43,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:43,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:43,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:43,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:07:43,219 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 17:07:43,219 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 17:07:43,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:43,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:43,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:07:43,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:43,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:43,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:43,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:07:43,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:07:43,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:43,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:43,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:43,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:07:43,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:43,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:43,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:43,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:07:43,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:07:43,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:43,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:43,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:43,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:43,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:43,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:43,225 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:07:43,225 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:07:43,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:43,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:43,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:43,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:07:43,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:43,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:43,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:43,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:07:43,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:07:43,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:43,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:43,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:43,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:07:43,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:43,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:43,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:43,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:07:43,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:07:43,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:43,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:43,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:43,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:07:43,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:43,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:43,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:43,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:07:43,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:07:43,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:43,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:43,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:43,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:07:43,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:43,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:43,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:43,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:07:43,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:07:43,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:43,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:43,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:43,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:07:43,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:43,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:43,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:43,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:07:43,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:07:43,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:43,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:43,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:43,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:43,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:43,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:43,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:07:43,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:07:43,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:43,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:43,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:43,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:07:43,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:43,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:43,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:43,238 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:07:43,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:07:43,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:43,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:43,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:43,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:07:43,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:43,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:43,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:43,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:07:43,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:07:43,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:43,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:43,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:43,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:07:43,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:43,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:43,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:43,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:07:43,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:07:43,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:43,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:43,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:43,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:43,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:43,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:43,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:07:43,244 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:07:43,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:43,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:43,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:43,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:43,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:43,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:43,247 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:07:43,247 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:07:43,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:07:43,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:07:43,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:07:43,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:07:43,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:07:43,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:07:43,251 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:07:43,251 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:07:43,262 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 17:07:43,270 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 17:07:43,271 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 17:07:43,271 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 17:07:43,272 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 17:07:43,272 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 17:07:43,272 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_avg_~i~0) = -2*ULTIMATE.start_avg_~i~0 + 9 Supporting invariants [] [2018-12-02 17:07:43,277 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-02 17:07:43,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:43,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:07:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:43,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:07:43,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:07:43,330 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 17:07:43,330 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-12-02 17:07:43,343 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 31 states and 38 transitions. Complement of second has 7 states. [2018-12-02 17:07:43,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 17:07:43,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 17:07:43,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-12-02 17:07:43,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 2 letters. [2018-12-02 17:07:43,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:07:43,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 16 letters. Loop has 2 letters. [2018-12-02 17:07:43,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:07:43,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 4 letters. [2018-12-02 17:07:43,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:07:43,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2018-12-02 17:07:43,346 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:07:43,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 28 states and 33 transitions. [2018-12-02 17:07:43,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-12-02 17:07:43,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-02 17:07:43,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2018-12-02 17:07:43,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:07:43,347 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-12-02 17:07:43,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2018-12-02 17:07:43,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-02 17:07:43,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 17:07:43,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-12-02 17:07:43,349 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-12-02 17:07:43,349 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-12-02 17:07:43,349 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 17:07:43,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2018-12-02 17:07:43,350 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:07:43,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:07:43,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:07:43,350 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:07:43,350 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:07:43,350 INFO L794 eck$LassoCheckResult]: Stem: 662#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 660#L-1 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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 656#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 657#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 658#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 659#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 661#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 672#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 671#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 670#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 669#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 668#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 667#L23-3 assume !(main_~i~1 < 5); 655#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 647#L9-3 assume !(avg_~i~0 < 5); 645#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 646#L12 main_#t~ret4 := avg_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 665#L9-8 [2018-12-02 17:07:43,351 INFO L796 eck$LassoCheckResult]: Loop: 665#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 666#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 665#L9-8 [2018-12-02 17:07:43,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:43,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1638581027, now seen corresponding path program 1 times [2018-12-02 17:07:43,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:43,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:43,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:43,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:43,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:43,371 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 17:07:43,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:07:43,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:07:43,371 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:07:43,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:43,372 INFO L82 PathProgramCache]: Analyzing trace with hash 2243, now seen corresponding path program 1 times [2018-12-02 17:07:43,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:43,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:43,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:43,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:43,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:43,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:07:43,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:07:43,394 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-02 17:07:43,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:43,408 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-12-02 17:07:43,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:07:43,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2018-12-02 17:07:43,409 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:07:43,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 37 transitions. [2018-12-02 17:07:43,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-02 17:07:43,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-02 17:07:43,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 37 transitions. [2018-12-02 17:07:43,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:07:43,409 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-12-02 17:07:43,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 37 transitions. [2018-12-02 17:07:43,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-12-02 17:07:43,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-02 17:07:43,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-12-02 17:07:43,411 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-12-02 17:07:43,411 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-12-02 17:07:43,411 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-02 17:07:43,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2018-12-02 17:07:43,412 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:07:43,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:07:43,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:07:43,412 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:07:43,412 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:07:43,412 INFO L794 eck$LassoCheckResult]: Stem: 728#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 727#L-1 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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 723#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 724#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 725#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 726#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 740#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 739#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 738#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 737#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 736#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 735#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 734#L23-3 assume !(main_~i~1 < 5); 722#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 714#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 715#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 716#L9-3 assume !(avg_~i~0 < 5); 712#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 713#L12 main_#t~ret4 := avg_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 731#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 732#L9-7 [2018-12-02 17:07:43,412 INFO L796 eck$LassoCheckResult]: Loop: 732#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 733#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 732#L9-7 [2018-12-02 17:07:43,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:43,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1577614809, now seen corresponding path program 1 times [2018-12-02 17:07:43,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:43,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:43,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:43,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:43,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:43,434 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 17:07:43,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:07:43,434 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ccbd08-2ae1-47d7-a811-18c7abe9ca2d/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-12-02 17:07:43,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:43,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:07:43,457 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 17:07:43,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:07:43,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-02 17:07:43,472 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:07:43,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:43,472 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 2 times [2018-12-02 17:07:43,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:43,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:43,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:43,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:43,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:43,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:07:43,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:07:43,494 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-12-02 17:07:43,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:43,516 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-12-02 17:07:43,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:07:43,517 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 43 transitions. [2018-12-02 17:07:43,517 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:07:43,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 43 transitions. [2018-12-02 17:07:43,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-12-02 17:07:43,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-02 17:07:43,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 43 transitions. [2018-12-02 17:07:43,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:07:43,518 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-12-02 17:07:43,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 43 transitions. [2018-12-02 17:07:43,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-12-02 17:07:43,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 17:07:43,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-12-02 17:07:43,519 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-12-02 17:07:43,519 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-12-02 17:07:43,519 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-02 17:07:43,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 37 transitions. [2018-12-02 17:07:43,519 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:07:43,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:07:43,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:07:43,520 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:07:43,520 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:07:43,520 INFO L794 eck$LassoCheckResult]: Stem: 866#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 862#L-1 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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 858#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 859#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 860#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 861#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 863#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 876#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 875#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 874#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 873#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 872#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 871#L23-3 assume !(main_~i~1 < 5); 857#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 847#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 848#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 849#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 850#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 854#L9-3 assume !(avg_~i~0 < 5); 845#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 846#L12 main_#t~ret4 := avg_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 869#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 870#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 867#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 868#L9-7 [2018-12-02 17:07:43,520 INFO L796 eck$LassoCheckResult]: Loop: 868#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 877#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 868#L9-7 [2018-12-02 17:07:43,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:43,520 INFO L82 PathProgramCache]: Analyzing trace with hash -483964569, now seen corresponding path program 1 times [2018-12-02 17:07:43,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:43,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:43,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:43,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:07:43,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:43,542 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-02 17:07:43,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:07:43,542 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ccbd08-2ae1-47d7-a811-18c7abe9ca2d/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-12-02 17:07:43,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:43,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:07:43,574 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-02 17:07:43,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:07:43,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-02 17:07:43,590 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:07:43,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:43,590 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 3 times [2018-12-02 17:07:43,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:43,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:43,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:43,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:43,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:43,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:07:43,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:07:43,625 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-12-02 17:07:43,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:43,651 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-12-02 17:07:43,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 17:07:43,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 49 transitions. [2018-12-02 17:07:43,652 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:07:43,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 49 transitions. [2018-12-02 17:07:43,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-12-02 17:07:43,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-12-02 17:07:43,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 49 transitions. [2018-12-02 17:07:43,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:07:43,653 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-12-02 17:07:43,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 49 transitions. [2018-12-02 17:07:43,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2018-12-02 17:07:43,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-02 17:07:43,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-12-02 17:07:43,654 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-12-02 17:07:43,654 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-12-02 17:07:43,654 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-02 17:07:43,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2018-12-02 17:07:43,655 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:07:43,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:07:43,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:07:43,655 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:07:43,655 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:07:43,655 INFO L794 eck$LassoCheckResult]: Stem: 1021#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1018#L-1 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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1014#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1015#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1016#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1017#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1036#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1035#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1033#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1032#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1031#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1030#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1029#L23-3 assume !(main_~i~1 < 5); 1013#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1003#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1004#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1005#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1006#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1010#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1028#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1027#L9-3 assume !(avg_~i~0 < 5); 1001#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 1002#L12 main_#t~ret4 := avg_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1024#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1025#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1026#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1037#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1022#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1023#L9-7 [2018-12-02 17:07:43,655 INFO L796 eck$LassoCheckResult]: Loop: 1023#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1034#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1023#L9-7 [2018-12-02 17:07:43,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:43,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1757450151, now seen corresponding path program 2 times [2018-12-02 17:07:43,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:43,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:43,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:43,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:07:43,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:43,677 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-02 17:07:43,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:07:43,677 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ccbd08-2ae1-47d7-a811-18c7abe9ca2d/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-12-02 17:07:43,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 17:07:43,700 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 17:07:43,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 17:07:43,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:07:43,707 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-02 17:07:43,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:07:43,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-12-02 17:07:43,723 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:07:43,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:43,723 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 4 times [2018-12-02 17:07:43,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:43,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:43,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:43,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:07:43,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:43,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 17:07:43,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:07:43,745 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-12-02 17:07:43,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:43,780 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-12-02 17:07:43,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 17:07:43,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 55 transitions. [2018-12-02 17:07:43,781 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:07:43,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 55 transitions. [2018-12-02 17:07:43,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-12-02 17:07:43,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-12-02 17:07:43,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 55 transitions. [2018-12-02 17:07:43,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:07:43,782 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-12-02 17:07:43,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 55 transitions. [2018-12-02 17:07:43,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2018-12-02 17:07:43,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 17:07:43,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-12-02 17:07:43,784 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-12-02 17:07:43,785 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-12-02 17:07:43,785 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-02 17:07:43,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 45 transitions. [2018-12-02 17:07:43,785 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:07:43,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:07:43,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:07:43,786 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:07:43,786 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:07:43,786 INFO L794 eck$LassoCheckResult]: Stem: 1199#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1196#L-1 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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1192#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1193#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1194#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1195#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1213#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1212#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1209#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1208#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1207#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1206#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1205#L23-3 assume !(main_~i~1 < 5); 1191#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1182#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1183#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1184#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1185#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1216#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1215#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1214#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1204#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1203#L9-3 assume !(avg_~i~0 < 5); 1180#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 1181#L12 main_#t~ret4 := avg_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1200#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1201#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1202#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1220#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1219#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1218#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1217#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1211#L9-7 [2018-12-02 17:07:43,786 INFO L796 eck$LassoCheckResult]: Loop: 1211#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1210#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1211#L9-7 [2018-12-02 17:07:43,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:43,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1218450663, now seen corresponding path program 3 times [2018-12-02 17:07:43,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:43,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:43,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:43,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:07:43,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:43,829 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-12-02 17:07:43,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:07:43,830 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74ccbd08-2ae1-47d7-a811-18c7abe9ca2d/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-12-02 17:07:43,837 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 17:07:43,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-02 17:07:43,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 17:07:43,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:07:43,878 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-12-02 17:07:43,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:07:43,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-02 17:07:43,903 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:07:43,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:43,903 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 5 times [2018-12-02 17:07:43,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:43,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:43,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:43,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:07:43,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:43,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 17:07:43,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 17:07:43,922 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. cyclomatic complexity: 9 Second operand 8 states. [2018-12-02 17:07:43,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:43,969 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-12-02 17:07:43,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 17:07:43,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 58 transitions. [2018-12-02 17:07:43,970 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:07:43,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 58 transitions. [2018-12-02 17:07:43,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-12-02 17:07:43,971 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-12-02 17:07:43,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 58 transitions. [2018-12-02 17:07:43,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:07:43,971 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-12-02 17:07:43,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 58 transitions. [2018-12-02 17:07:43,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-12-02 17:07:43,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-02 17:07:43,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-12-02 17:07:43,973 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-12-02 17:07:43,973 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-12-02 17:07:43,973 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-02 17:07:43,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 49 transitions. [2018-12-02 17:07:43,974 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:07:43,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:07:43,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:07:43,975 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:07:43,975 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:07:43,975 INFO L794 eck$LassoCheckResult]: Stem: 1397#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1396#L-1 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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1392#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1393#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1394#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1395#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1418#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1416#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1414#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1412#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1410#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1408#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1407#L23-3 assume !(main_~i~1 < 5); 1391#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1381#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1382#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1383#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1384#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1388#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1423#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1422#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1421#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1420#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1404#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1403#L9-3 assume !(avg_~i~0 < 5); 1379#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 1380#L12 main_#t~ret4 := avg_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1400#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1401#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1402#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1419#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1417#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1415#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1413#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1411#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1409#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1406#L9-7 [2018-12-02 17:07:43,975 INFO L796 eck$LassoCheckResult]: Loop: 1406#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1405#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1406#L9-7 [2018-12-02 17:07:43,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:43,975 INFO L82 PathProgramCache]: Analyzing trace with hash -2144167641, now seen corresponding path program 4 times [2018-12-02 17:07:43,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:43,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:43,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:43,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:07:43,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:44,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:44,019 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 6 times [2018-12-02 17:07:44,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:44,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:44,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:44,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:07:44,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:44,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:44,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1039200421, now seen corresponding path program 5 times [2018-12-02 17:07:44,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:44,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:44,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:44,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:07:44,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:44,106 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-12-02 17:07:44,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:07:44,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 17:07:44,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 17:07:44,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-12-02 17:07:44,123 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. cyclomatic complexity: 9 Second operand 10 states. [2018-12-02 17:07:44,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:44,215 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-12-02 17:07:44,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 17:07:44,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 55 transitions. [2018-12-02 17:07:44,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 17:07:44,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 42 states and 43 transitions. [2018-12-02 17:07:44,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-12-02 17:07:44,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-12-02 17:07:44,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 43 transitions. [2018-12-02 17:07:44,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:07:44,217 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-12-02 17:07:44,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 43 transitions. [2018-12-02 17:07:44,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-02 17:07:44,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 17:07:44,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-12-02 17:07:44,218 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-12-02 17:07:44,218 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-12-02 17:07:44,218 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-02 17:07:44,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 43 transitions. [2018-12-02 17:07:44,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 17:07:44,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:07:44,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:07:44,219 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:07:44,219 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:07:44,219 INFO L794 eck$LassoCheckResult]: Stem: 1520#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1517#L-1 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;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1513#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1514#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1515#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1516#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1538#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1537#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1535#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1533#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1531#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1528#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1527#L23-3 assume !(main_~i~1 < 5); 1512#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1507#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1508#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1509#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1536#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1534#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1532#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1530#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1529#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1526#L9-3 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1525#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1524#L9-3 assume !(avg_~i~0 < 5); 1505#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 1506#L12 main_#t~ret4 := avg_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1521#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1522#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1523#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1546#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1545#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1544#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1543#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1542#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1541#L9-8 assume !!(avg_~i~0 < 5);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1540#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1539#L9-8 assume !(avg_~i~0 < 5); 1518#L9-9 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 5 then 1 + avg_~ret~0 / 5 else avg_~ret~0 / 5) % 4294967296 - 4294967296); 1519#L12-1 main_#t~ret7 := avg_#res;main_~ret2~0 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;main_~i~2 := 0; 1510#L32-3 [2018-12-02 17:07:44,219 INFO L796 eck$LassoCheckResult]: Loop: 1510#L32-3 assume !!(main_~i~2 < 4);call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem10; 1511#L32-2 main_#t~post9 := main_~i~2;main_~i~2 := 1 + main_#t~post9;havoc main_#t~post9; 1510#L32-3 [2018-12-02 17:07:44,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:44,219 INFO L82 PathProgramCache]: Analyzing trace with hash -2055775835, now seen corresponding path program 1 times [2018-12-02 17:07:44,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:44,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:44,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:44,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:07:44,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:44,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:44,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:44,281 INFO L82 PathProgramCache]: Analyzing trace with hash 2755, now seen corresponding path program 1 times [2018-12-02 17:07:44,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:44,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:44,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:44,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:44,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:44,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:44,284 INFO L82 PathProgramCache]: Analyzing trace with hash 84380519, now seen corresponding path program 1 times [2018-12-02 17:07:44,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:07:44,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:07:44,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:44,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:44,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:07:46,486 WARN L180 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 335 DAG size of output: 257 [2018-12-02 17:10:21,116 WARN L180 SmtUtils]: Spent 2.57 m on a formula simplification. DAG size of input: 224 DAG size of output: 151 [2018-12-02 17:10:21,119 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 17:10:21,119 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 17:10:21,119 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 17:10:21,119 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 17:10:21,119 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 17:10:21,119 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 17:10:21,119 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 17:10:21,119 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 17:10:21,119 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg05_true-unreach-call_true-termination.i_Iteration14_Lasso [2018-12-02 17:10:21,119 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 17:10:21,119 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 17:10:21,122 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-02 17:10:21,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:10:21,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:10:21,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:10:21,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:10:21,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:10:21,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-12-02 17:10:21,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:10:21,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:10:21,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-12-02 17:10:21,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:10:21,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:10:21,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-12-02 17:10:21,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:10:21,675 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 110 [2018-12-02 17:10:27,208 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 6018 conjuctions. This might take some time... [2018-12-02 17:10:27,255 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 6 conjuctions. [2018-12-02 17:10:28,109 WARN L180 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 114 [2018-12-02 17:10:28,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-12-02 17:10:28,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:10:28,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:10:28,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-12-02 17:10:28,178 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-02 17:10:29,586 WARN L180 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 246 DAG size of output: 143 [2018-12-02 17:10:29,596 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2018-12-02 17:10:31,777 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 209 DAG size of output: 129 [2018-12-02 17:10:31,793 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 17:10:31,793 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 17:10:31,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:10:31,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:31,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:10:31,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:31,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:31,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:31,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:10:31,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:10:31,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:10:31,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:10:31,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:31,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:10:31,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:31,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:31,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:31,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:10:31,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:10:31,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:10:31,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:10:31,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:31,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:10:31,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:31,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:31,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:31,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:10:31,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:10:31,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:10:31,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:10:31,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:31,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:31,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:31,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:31,799 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:10:31,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:10:31,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:10:31,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:10:31,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:31,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:10:31,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:31,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:31,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:31,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:10:31,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:10:31,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:10:31,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:10:31,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:31,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:10:31,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:31,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:31,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:31,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:10:31,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:10:31,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:10:31,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:10:31,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:31,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:31,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:31,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:31,803 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:10:31,803 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:10:31,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:10:31,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:10:31,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:31,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:10:31,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:31,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:31,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:31,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:10:31,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:10:31,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:10:31,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:10:31,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:31,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:10:31,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:31,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:31,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:31,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:10:31,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:10:31,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:10:31,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:10:31,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:31,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:10:31,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:31,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:31,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:31,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:10:31,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:10:31,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:10:31,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:10:31,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:31,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:10:31,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:31,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:31,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:31,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:10:31,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:10:31,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:10:31,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:10:31,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:31,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:10:31,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:31,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:31,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:31,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:10:31,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:10:31,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:10:31,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:10:31,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:31,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:31,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:31,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:31,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:10:31,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:10:31,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:10:31,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:10:31,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:31,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:10:31,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:31,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:31,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:31,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:10:31,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:10:31,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:10:31,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 17:10:31,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:10:31,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:10:31,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:10:31,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:10:31,817 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:10:31,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:10:31,825 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 17:10:31,832 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 17:10:31,832 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-02 17:10:31,833 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 17:10:31,833 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 17:10:31,833 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 17:10:31,833 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2) = -2*ULTIMATE.start_main_~i~2 + 7 Supporting invariants [] [2018-12-02 17:10:31,973 INFO L297 tatePredicateManager]: 39 out of 39 supporting invariants were superfluous and have been removed [2018-12-02 17:10:31,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:32,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:10:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:32,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:10:32,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:10:32,012 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 17:10:32,012 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 43 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-12-02 17:10:32,021 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 43 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 44 states and 46 transitions. Complement of second has 4 states. [2018-12-02 17:10:32,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 17:10:32,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 17:10:32,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-12-02 17:10:32,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 40 letters. Loop has 2 letters. [2018-12-02 17:10:32,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:10:32,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 42 letters. Loop has 2 letters. [2018-12-02 17:10:32,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:10:32,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 40 letters. Loop has 4 letters. [2018-12-02 17:10:32,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:10:32,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 46 transitions. [2018-12-02 17:10:32,023 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 17:10:32,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2018-12-02 17:10:32,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 17:10:32,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 17:10:32,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 17:10:32,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:10:32,024 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 17:10:32,024 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 17:10:32,024 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 17:10:32,024 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-12-02 17:10:32,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 17:10:32,024 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 17:10:32,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 17:10:32,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 05:10:32 BoogieIcfgContainer [2018-12-02 17:10:32,030 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 17:10:32,030 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 17:10:32,030 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 17:10:32,030 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 17:10:32,031 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:07:41" (3/4) ... [2018-12-02 17:10:32,033 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 17:10:32,034 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 17:10:32,034 INFO L168 Benchmark]: Toolchain (without parser) took 170927.18 ms. Allocated memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: 2.2 GB). Free memory was 961.4 MB in the beginning and 2.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 814.6 MB. Max. memory is 11.5 GB. [2018-12-02 17:10:32,035 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 17:10:32,035 INFO L168 Benchmark]: CACSL2BoogieTranslator took 139.14 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 950.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 17:10:32,036 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -146.9 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2018-12-02 17:10:32,036 INFO L168 Benchmark]: Boogie Preprocessor took 16.21 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 17:10:32,036 INFO L168 Benchmark]: RCFGBuilder took 171.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-02 17:10:32,037 INFO L168 Benchmark]: BuchiAutomizer took 170534.09 ms. Allocated memory was 1.1 GB in the beginning and 3.2 GB in the end (delta: 2.1 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 826.4 MB. Max. memory is 11.5 GB. [2018-12-02 17:10:32,037 INFO L168 Benchmark]: Witness Printer took 3.51 ms. Allocated memory is still 3.2 GB. Free memory is still 2.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 17:10:32,040 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 139.14 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 950.6 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 60.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -146.9 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.21 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 171.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 170534.09 ms. Allocated memory was 1.1 GB in the beginning and 3.2 GB in the end (delta: 2.1 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 826.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.51 ms. Allocated memory is still 3.2 GB. Free memory is still 2.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * 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 -2 * i + 9 and consists of 5 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 3 locations. 11 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 170.5s and 15 iterations. TraceHistogramMax:5. Analysis of lassos took 169.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 41 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 45 states and ocurred in iteration 12. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 238 SDtfs, 190 SDslu, 454 SDs, 0 SdLazy, 300 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU10 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital1700 mio100 ax100 hnf99 lsp475 ukn40 mio100 lsp219 div80 bol100 ite100 ukn100 eq167 hnf91 smp72 dnf1304 smp68 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 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...