./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/reducercommutativity/sep_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_068b63ef-7998-458e-885a-23bd7c336c08/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_068b63ef-7998-458e-885a-23bd7c336c08/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_068b63ef-7998-458e-885a-23bd7c336c08/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_068b63ef-7998-458e-885a-23bd7c336c08/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/sep_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_068b63ef-7998-458e-885a-23bd7c336c08/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_068b63ef-7998-458e-885a-23bd7c336c08/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 e150e83dea41703782a488455769a24bf6c8f600 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:26:11,771 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:26:11,772 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:26:11,779 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:26:11,780 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:26:11,780 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:26:11,781 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:26:11,782 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:26:11,783 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:26:11,784 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:26:11,785 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:26:11,785 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:26:11,786 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:26:11,787 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:26:11,787 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:26:11,788 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:26:11,789 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:26:11,790 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:26:11,791 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:26:11,792 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:26:11,793 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:26:11,794 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:26:11,796 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:26:11,796 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:26:11,796 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:26:11,797 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:26:11,797 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:26:11,798 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:26:11,798 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:26:11,799 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:26:11,799 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:26:11,800 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:26:11,800 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:26:11,800 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:26:11,801 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:26:11,801 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:26:11,801 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_068b63ef-7998-458e-885a-23bd7c336c08/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 07:26:11,812 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:26:11,812 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:26:11,813 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:26:11,813 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:26:11,813 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:26:11,814 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 07:26:11,814 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 07:26:11,814 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 07:26:11,814 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 07:26:11,814 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 07:26:11,814 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 07:26:11,814 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:26:11,815 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:26:11,815 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 07:26:11,815 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:26:11,815 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:26:11,815 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:26:11,815 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 07:26:11,815 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 07:26:11,816 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 07:26:11,816 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:26:11,816 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:26:11,816 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 07:26:11,816 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 07:26:11,816 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:26:11,816 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:26:11,817 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 07:26:11,817 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:26:11,817 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:26:11,817 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 07:26:11,818 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 07:26:11,818 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_068b63ef-7998-458e-885a-23bd7c336c08/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 -> e150e83dea41703782a488455769a24bf6c8f600 [2018-11-10 07:26:11,843 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:26:11,852 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:26:11,855 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:26:11,856 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:26:11,856 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:26:11,856 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_068b63ef-7998-458e-885a-23bd7c336c08/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/sep_true-unreach-call_true-termination.i [2018-11-10 07:26:11,894 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_068b63ef-7998-458e-885a-23bd7c336c08/bin-2019/uautomizer/data/8a6a3c52b/d899d2bb746141d0a0ab83b9afd6bb16/FLAG2548ab5ae [2018-11-10 07:26:12,217 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:26:12,217 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_068b63ef-7998-458e-885a-23bd7c336c08/sv-benchmarks/c/reducercommutativity/sep_true-unreach-call_true-termination.i [2018-11-10 07:26:12,221 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_068b63ef-7998-458e-885a-23bd7c336c08/bin-2019/uautomizer/data/8a6a3c52b/d899d2bb746141d0a0ab83b9afd6bb16/FLAG2548ab5ae [2018-11-10 07:26:12,230 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_068b63ef-7998-458e-885a-23bd7c336c08/bin-2019/uautomizer/data/8a6a3c52b/d899d2bb746141d0a0ab83b9afd6bb16 [2018-11-10 07:26:12,232 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:26:12,233 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:26:12,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:26:12,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:26:12,237 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:26:12,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:26:12" (1/1) ... [2018-11-10 07:26:12,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@680a2912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:12, skipping insertion in model container [2018-11-10 07:26:12,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:26:12" (1/1) ... [2018-11-10 07:26:12,249 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:26:12,267 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:26:12,384 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:26:12,390 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:26:12,403 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:26:12,414 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:26:12,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:12 WrapperNode [2018-11-10 07:26:12,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:26:12,415 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:26:12,415 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:26:12,415 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:26:12,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:12" (1/1) ... [2018-11-10 07:26:12,429 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:12" (1/1) ... [2018-11-10 07:26:12,446 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:26:12,446 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:26:12,446 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:26:12,446 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:26:12,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:12" (1/1) ... [2018-11-10 07:26:12,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:12" (1/1) ... [2018-11-10 07:26:12,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:12" (1/1) ... [2018-11-10 07:26:12,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:12" (1/1) ... [2018-11-10 07:26:12,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:12" (1/1) ... [2018-11-10 07:26:12,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:12" (1/1) ... [2018-11-10 07:26:12,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:12" (1/1) ... [2018-11-10 07:26:12,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:26:12,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:26:12,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:26:12,467 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:26:12,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_068b63ef-7998-458e-885a-23bd7c336c08/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:26:12,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 07:26:12,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:26:12,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:26:12,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 07:26:12,740 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:26:12,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:26:12 BoogieIcfgContainer [2018-11-10 07:26:12,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:26:12,741 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 07:26:12,741 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 07:26:12,744 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 07:26:12,744 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:26:12,745 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 07:26:12" (1/3) ... [2018-11-10 07:26:12,745 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24be1e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:26:12, skipping insertion in model container [2018-11-10 07:26:12,746 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:26:12,746 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:26:12" (2/3) ... [2018-11-10 07:26:12,746 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24be1e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:26:12, skipping insertion in model container [2018-11-10 07:26:12,746 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:26:12,746 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:26:12" (3/3) ... [2018-11-10 07:26:12,747 INFO L375 chiAutomizerObserver]: Analyzing ICFG sep_true-unreach-call_true-termination.i [2018-11-10 07:26:12,779 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:26:12,780 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 07:26:12,780 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 07:26:12,780 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 07:26:12,780 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:26:12,780 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:26:12,780 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 07:26:12,780 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:26:12,780 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 07:26:12,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states. [2018-11-10 07:26:12,805 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-11-10 07:26:12,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:26:12,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:26:12,809 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 07:26:12,810 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 07:26:12,810 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 07:26:12,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states. [2018-11-10 07:26:12,812 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-11-10 07:26:12,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:26:12,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:26:12,812 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 07:26:12,812 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 07:26:12,817 INFO L793 eck$LassoCheckResult]: Stem: 44#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 20#L23true assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 4#L9-4true [2018-11-10 07:26:12,817 INFO L795 eck$LassoCheckResult]: Loop: 4#L9-4true assume true; 10#L9-1true assume !!(sep_~i~0 < ~N~0); 46#L11true SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11 43#L11-1true assume (if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0;havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := sep_#t~post2 + 1;havoc sep_#t~post2; 7#L9-3true sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 4#L9-4true [2018-11-10 07:26:12,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:12,821 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-11-10 07:26:12,823 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:12,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:12,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:12,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:26:12,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:12,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:12,894 INFO L82 PathProgramCache]: Analyzing trace with hash 37372909, now seen corresponding path program 1 times [2018-11-10 07:26:12,894 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:12,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:12,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:12,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:26:12,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:12,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:12,918 INFO L82 PathProgramCache]: Analyzing trace with hash 119442412, now seen corresponding path program 1 times [2018-11-10 07:26:12,918 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:12,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:12,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:12,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:26:12,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:13,138 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:26:13,139 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:26:13,139 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:26:13,139 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:26:13,140 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:26:13,140 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:26:13,140 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:26:13,140 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:26:13,140 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-10 07:26:13,140 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:26:13,141 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:26:13,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:13,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:13,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:13,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:13,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:13,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:13,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:13,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:13,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:13,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:13,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:13,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:13,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:13,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:13,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:13,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:13,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:13,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:13,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:13,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:13,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:13,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:13,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:13,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:13,638 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:26:13,642 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:26:13,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:13,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:13,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:13,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:13,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:13,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:13,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:13,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:13,650 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:13,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:13,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:13,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:13,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:13,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:13,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:13,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:13,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:13,653 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:13,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:13,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:13,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:13,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:13,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:13,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:13,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:13,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:13,656 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:13,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:13,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:13,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:13,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:13,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:13,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:13,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:13,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:13,659 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:13,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:13,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:13,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:13,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:13,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:13,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:13,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:13,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:13,662 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:13,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:13,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:13,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:13,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:13,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:13,666 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:26:13,666 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:26:13,669 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:13,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:13,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:13,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:13,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:13,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:13,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:13,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:13,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:13,673 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:13,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:13,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:13,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:13,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:13,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:13,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:13,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:13,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:13,676 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:13,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:13,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:13,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:13,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:13,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:13,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:13,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:13,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:13,678 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:13,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:13,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:13,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:13,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:13,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:13,681 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:26:13,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:26:13,693 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:13,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:13,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:13,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:13,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:13,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:13,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:13,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:13,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:13,695 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:13,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:13,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:13,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:13,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:13,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:13,697 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:26:13,697 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:26:13,699 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:13,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:13,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:13,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:13,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:13,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:13,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:13,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:13,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:13,702 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:13,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:13,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:13,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:13,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:13,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:13,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:13,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:13,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:13,705 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:13,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:13,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:13,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:13,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:13,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:13,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:13,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:13,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:13,708 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:13,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:13,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:13,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:13,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:13,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:13,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:13,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:13,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:13,710 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:13,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:13,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:13,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:13,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:13,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:13,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:13,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:13,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:13,713 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:13,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:13,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:13,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:13,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:13,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:13,717 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:26:13,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:26:13,720 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:13,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:13,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:13,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:13,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:13,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:13,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:26:13,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:26:13,728 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:13,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:13,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:13,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:13,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:13,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:13,731 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:26:13,731 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:26:13,740 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:13,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:13,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:13,741 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 07:26:13,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:13,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:13,743 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 07:26:13,743 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:26:13,757 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:13,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:13,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:13,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:13,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:13,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:13,762 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:26:13,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:26:13,787 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:26:13,806 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 07:26:13,807 INFO L444 ModelExtractionUtils]: 24 out of 31 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 07:26:13,809 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:26:13,810 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:26:13,810 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:26:13,811 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, ULTIMATE.start_sep_~i~0) = 1*~N~0 - 1*ULTIMATE.start_sep_~i~0 Supporting invariants [] [2018-11-10 07:26:13,824 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 07:26:13,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:26:13,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:26:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:26:13,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:26:13,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:26:13,887 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 07:26:13,888 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states. Second operand 4 states. [2018-11-10 07:26:13,925 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states.. Second operand 4 states. Result 104 states and 126 transitions. Complement of second has 8 states. [2018-11-10 07:26:13,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:26:13,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 07:26:13,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2018-11-10 07:26:13,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 70 transitions. Stem has 3 letters. Loop has 5 letters. [2018-11-10 07:26:13,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:26:13,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 70 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-10 07:26:13,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:26:13,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 70 transitions. Stem has 3 letters. Loop has 10 letters. [2018-11-10 07:26:13,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:26:13,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 126 transitions. [2018-11-10 07:26:13,934 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-10 07:26:13,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 41 states and 50 transitions. [2018-11-10 07:26:13,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-11-10 07:26:13,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-10 07:26:13,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 50 transitions. [2018-11-10 07:26:13,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:26:13,938 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-10 07:26:13,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 50 transitions. [2018-11-10 07:26:13,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-10 07:26:13,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 07:26:13,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2018-11-10 07:26:13,957 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-10 07:26:13,958 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-10 07:26:13,958 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 07:26:13,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 50 transitions. [2018-11-10 07:26:13,959 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-10 07:26:13,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:26:13,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:26:13,959 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:26:13,959 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 07:26:13,960 INFO L793 eck$LassoCheckResult]: Stem: 255#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 239#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 240#L23 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 219#L9-4 assume true; 220#L9-1 assume !(sep_~i~0 < ~N~0); 231#L9-5 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 223#L16 main_#t~ret5 := sep_#res;assume { :end_inline_sep } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5; 224#L32 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L32 234#L32-1 main_~temp~0 := main_#t~mem6;havoc main_#t~mem6; 235#L32-2 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L32-2 252#L32-3 SUMMARY for call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L32-3 251#L32-4 havoc main_#t~mem7; 249#L32-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L32-5 248#L32-6 assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 236#L9-10 [2018-11-10 07:26:13,960 INFO L795 eck$LassoCheckResult]: Loop: 236#L9-10 assume true; 238#L9-7 assume !!(sep_~i~0 < ~N~0); 230#L11-3 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11-3 228#L11-4 assume (if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0;havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := sep_#t~post2 + 1;havoc sep_#t~post2; 229#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 236#L9-10 [2018-11-10 07:26:13,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:13,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1418496903, now seen corresponding path program 1 times [2018-11-10 07:26:13,960 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:13,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:13,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:13,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:26:13,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:26:14,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:26:14,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:26:14,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:26:14,021 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:26:14,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:14,021 INFO L82 PathProgramCache]: Analyzing trace with hash 66002059, now seen corresponding path program 1 times [2018-11-10 07:26:14,021 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:14,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:14,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:14,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:26:14,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:14,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:26:14,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:26:14,082 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-10 07:26:14,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:26:14,105 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-10 07:26:14,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:26:14,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 53 transitions. [2018-11-10 07:26:14,107 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-10 07:26:14,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 52 transitions. [2018-11-10 07:26:14,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-10 07:26:14,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-10 07:26:14,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 52 transitions. [2018-11-10 07:26:14,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:26:14,109 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 52 transitions. [2018-11-10 07:26:14,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 52 transitions. [2018-11-10 07:26:14,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-11-10 07:26:14,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 07:26:14,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-10 07:26:14,112 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-10 07:26:14,112 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-10 07:26:14,112 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 07:26:14,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 47 transitions. [2018-11-10 07:26:14,113 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-10 07:26:14,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:26:14,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:26:14,114 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:26:14,114 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 07:26:14,114 INFO L793 eck$LassoCheckResult]: Stem: 348#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 327#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 328#L23 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 310#L9-4 assume true; 311#L9-1 assume !!(sep_~i~0 < ~N~0); 324#L11 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11 347#L11-1 assume !((if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0);havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 318#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 312#L9-4 assume true; 313#L9-1 assume !(sep_~i~0 < ~N~0); 323#L9-5 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 316#L16 main_#t~ret5 := sep_#res;assume { :end_inline_sep } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5; 317#L32 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L32 329#L32-1 main_~temp~0 := main_#t~mem6;havoc main_#t~mem6; 330#L32-2 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L32-2 345#L32-3 SUMMARY for call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L32-3 343#L32-4 havoc main_#t~mem7; 342#L32-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L32-5 341#L32-6 assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 331#L9-10 [2018-11-10 07:26:14,114 INFO L795 eck$LassoCheckResult]: Loop: 331#L9-10 assume true; 332#L9-7 assume !!(sep_~i~0 < ~N~0); 325#L11-3 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11-3 321#L11-4 assume (if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0;havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := sep_#t~post2 + 1;havoc sep_#t~post2; 322#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 331#L9-10 [2018-11-10 07:26:14,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:14,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1311713295, now seen corresponding path program 1 times [2018-11-10 07:26:14,114 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:14,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:14,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:14,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:26:14,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:26:14,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:26:14,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:26:14,170 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_068b63ef-7998-458e-885a-23bd7c336c08/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:26:14,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:26:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:26:14,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:26:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:26:14,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:26:14,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-10 07:26:14,247 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:26:14,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:14,247 INFO L82 PathProgramCache]: Analyzing trace with hash 66002059, now seen corresponding path program 2 times [2018-11-10 07:26:14,247 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:14,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:14,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:14,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:26:14,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:14,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:26:14,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:26:14,305 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. cyclomatic complexity: 10 Second operand 6 states. [2018-11-10 07:26:14,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:26:14,367 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-10 07:26:14,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:26:14,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 59 transitions. [2018-11-10 07:26:14,369 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-10 07:26:14,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 50 states and 58 transitions. [2018-11-10 07:26:14,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-10 07:26:14,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-10 07:26:14,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 58 transitions. [2018-11-10 07:26:14,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:26:14,370 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 58 transitions. [2018-11-10 07:26:14,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 58 transitions. [2018-11-10 07:26:14,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-11-10 07:26:14,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-10 07:26:14,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-11-10 07:26:14,372 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-11-10 07:26:14,372 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-11-10 07:26:14,372 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 07:26:14,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 53 transitions. [2018-11-10 07:26:14,373 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-10 07:26:14,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:26:14,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:26:14,374 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:26:14,374 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 07:26:14,374 INFO L793 eck$LassoCheckResult]: Stem: 505#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 484#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 485#L23 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 465#L9-4 assume true; 466#L9-1 assume !!(sep_~i~0 < ~N~0); 508#L11 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11 507#L11-1 assume !((if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0);havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 506#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 467#L9-4 assume true; 468#L9-1 assume !!(sep_~i~0 < ~N~0); 481#L11 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11 504#L11-1 assume !((if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0);havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 473#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 474#L9-4 assume true; 479#L9-1 assume !(sep_~i~0 < ~N~0); 480#L9-5 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 471#L16 main_#t~ret5 := sep_#res;assume { :end_inline_sep } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5; 472#L32 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L32 486#L32-1 main_~temp~0 := main_#t~mem6;havoc main_#t~mem6; 487#L32-2 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L32-2 502#L32-3 SUMMARY for call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L32-3 500#L32-4 havoc main_#t~mem7; 499#L32-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L32-5 498#L32-6 assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 488#L9-10 [2018-11-10 07:26:14,374 INFO L795 eck$LassoCheckResult]: Loop: 488#L9-10 assume true; 489#L9-7 assume !!(sep_~i~0 < ~N~0); 482#L11-3 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11-3 477#L11-4 assume (if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0;havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := sep_#t~post2 + 1;havoc sep_#t~post2; 478#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 488#L9-10 [2018-11-10 07:26:14,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:14,374 INFO L82 PathProgramCache]: Analyzing trace with hash -635510919, now seen corresponding path program 2 times [2018-11-10 07:26:14,375 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:14,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:14,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:14,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:26:14,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:14,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:14,412 INFO L82 PathProgramCache]: Analyzing trace with hash 66002059, now seen corresponding path program 3 times [2018-11-10 07:26:14,412 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:14,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:14,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:14,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:26:14,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:14,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:14,420 INFO L82 PathProgramCache]: Analyzing trace with hash 571025427, now seen corresponding path program 1 times [2018-11-10 07:26:14,420 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:14,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:14,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:14,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:26:14,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:26:14,789 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:26:14,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:26:14,789 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_068b63ef-7998-458e-885a-23bd7c336c08/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:26:14,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:26:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:26:14,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:26:14,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2018-11-10 07:26:14,949 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:26:14,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 43 [2018-11-10 07:26:14,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:26:14,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:26:14,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:26:14,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-11-10 07:26:14,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2018-11-10 07:26:14,987 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:26:14,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-11-10 07:26:14,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:26:14,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:26:14,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:26:14,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:23 [2018-11-10 07:26:15,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-11-10 07:26:15,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2018-11-10 07:26:15,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:26:15,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:26:15,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:26:15,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:11 [2018-11-10 07:26:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:26:15,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:26:15,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2018-11-10 07:26:15,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 07:26:15,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-11-10 07:26:15,088 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. cyclomatic complexity: 11 Second operand 18 states. [2018-11-10 07:26:15,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:26:15,791 INFO L93 Difference]: Finished difference Result 157 states and 183 transitions. [2018-11-10 07:26:15,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-10 07:26:15,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 183 transitions. [2018-11-10 07:26:15,793 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 43 [2018-11-10 07:26:15,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 157 states and 183 transitions. [2018-11-10 07:26:15,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2018-11-10 07:26:15,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2018-11-10 07:26:15,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 157 states and 183 transitions. [2018-11-10 07:26:15,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:26:15,796 INFO L705 BuchiCegarLoop]: Abstraction has 157 states and 183 transitions. [2018-11-10 07:26:15,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states and 183 transitions. [2018-11-10 07:26:15,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 68. [2018-11-10 07:26:15,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-10 07:26:15,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2018-11-10 07:26:15,801 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 79 transitions. [2018-11-10 07:26:15,801 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 79 transitions. [2018-11-10 07:26:15,801 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 07:26:15,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 79 transitions. [2018-11-10 07:26:15,802 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-10 07:26:15,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:26:15,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:26:15,803 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:26:15,803 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 07:26:15,803 INFO L793 eck$LassoCheckResult]: Stem: 854#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 823#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 824#L23 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 805#L9-4 assume true; 806#L9-1 assume !!(sep_~i~0 < ~N~0); 862#L11 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11 861#L11-1 assume !((if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0);havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 811#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 807#L9-4 assume true; 808#L9-1 assume !!(sep_~i~0 < ~N~0); 855#L11 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11 856#L11-1 assume (if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0;havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := sep_#t~post2 + 1;havoc sep_#t~post2; 853#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 857#L9-4 assume true; 858#L9-1 assume !(sep_~i~0 < ~N~0); 839#L9-5 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 840#L16 main_#t~ret5 := sep_#res;assume { :end_inline_sep } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5; 829#L32 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L32 830#L32-1 main_~temp~0 := main_#t~mem6;havoc main_#t~mem6; 849#L32-2 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L32-2 850#L32-3 SUMMARY for call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L32-3 845#L32-4 havoc main_#t~mem7; 846#L32-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L32-5 841#L32-6 assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 827#L9-10 [2018-11-10 07:26:15,803 INFO L795 eck$LassoCheckResult]: Loop: 827#L9-10 assume true; 828#L9-7 assume !!(sep_~i~0 < ~N~0); 820#L11-3 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11-3 821#L11-4 assume (if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0;havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := sep_#t~post2 + 1;havoc sep_#t~post2; 815#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 827#L9-10 [2018-11-10 07:26:15,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:15,803 INFO L82 PathProgramCache]: Analyzing trace with hash -48704905, now seen corresponding path program 1 times [2018-11-10 07:26:15,804 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:15,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:15,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:15,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:26:15,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:15,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:15,829 INFO L82 PathProgramCache]: Analyzing trace with hash 66002059, now seen corresponding path program 4 times [2018-11-10 07:26:15,829 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:15,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:15,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:15,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:26:15,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:15,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:15,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1729797163, now seen corresponding path program 1 times [2018-11-10 07:26:15,835 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:15,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:15,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:15,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:26:15,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:16,228 WARN L179 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 141 [2018-11-10 07:26:16,444 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2018-11-10 07:26:16,445 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:26:16,445 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:26:16,445 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:26:16,446 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:26:16,446 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:26:16,446 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:26:16,446 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:26:16,446 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:26:16,446 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep_true-unreach-call_true-termination.i_Iteration5_Lasso [2018-11-10 07:26:16,446 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:26:16,446 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:26:16,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:16,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:16,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:16,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:16,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:16,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:16,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:16,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:16,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:16,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:16,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:16,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:16,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:16,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:16,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:16,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:16,616 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2018-11-10 07:26:16,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:16,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:16,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:16,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:16,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:16,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:16,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:16,883 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:26:16,883 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:26:16,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:16,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:16,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:16,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:16,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:16,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:16,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:16,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:16,887 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:16,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:16,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:16,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:16,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:16,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:16,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:16,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:16,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:16,889 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:16,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:16,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:16,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:16,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:16,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:16,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:16,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:16,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:16,890 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:16,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:16,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:16,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:16,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:16,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:16,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:16,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:16,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:16,892 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:16,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:16,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:16,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:16,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:16,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:16,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:16,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:16,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:16,894 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:16,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-11-10 07:26:16,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:16,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:16,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:16,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:16,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:16,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:16,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:16,895 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:16,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:16,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:16,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:16,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:16,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:16,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:26:16,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:26:16,898 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:16,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:16,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:16,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:16,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:16,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:16,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:26:16,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:26:16,900 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:16,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-11-10 07:26:16,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:16,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:16,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:16,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:16,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:16,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:16,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:16,902 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:16,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:16,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:16,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:16,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:16,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:16,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:16,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:16,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:16,903 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:16,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:16,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:16,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:16,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:16,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:16,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:16,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:16,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:16,905 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:16,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:16,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:16,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:16,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:16,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:16,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:16,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:16,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:16,906 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:16,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:16,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:16,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:16,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:16,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:16,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:26:16,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:26:16,911 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:16,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-11-10 07:26:16,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:16,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:16,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:16,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:16,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:16,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:16,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:16,913 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:16,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-11-10 07:26:16,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:16,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:16,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:16,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:16,914 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:26:16,914 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:26:16,915 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:16,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:16,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:16,916 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 07:26:16,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:16,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:16,917 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 07:26:16,917 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:26:16,921 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:16,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:16,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:16,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:16,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:16,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:16,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:26:16,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:26:16,924 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:16,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:16,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:16,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:16,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:16,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:16,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:26:16,926 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:26:16,927 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:16,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:16,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:16,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:16,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:16,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:16,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:16,928 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:16,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:16,929 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:16,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-11-10 07:26:16,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:16,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:16,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:16,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:16,930 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:26:16,930 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:26:16,932 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:16,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:16,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:16,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:16,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:16,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:16,934 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:26:16,934 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:26:16,936 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:16,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-11-10 07:26:16,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:16,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:16,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:16,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:16,937 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:26:16,937 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:26:16,940 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:16,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:16,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:16,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:16,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:16,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:16,942 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:26:16,942 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:26:16,943 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:16,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-11-10 07:26:16,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:16,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:16,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:16,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:16,946 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:26:16,946 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:26:16,965 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:26:16,984 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-10 07:26:16,984 INFO L444 ModelExtractionUtils]: 24 out of 34 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-10 07:26:16,984 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:26:16,985 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:26:16,985 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:26:16,986 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, ULTIMATE.start_sep_~i~0) = 1*~N~0 - 1*ULTIMATE.start_sep_~i~0 Supporting invariants [] [2018-11-10 07:26:17,009 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-10 07:26:17,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:26:17,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:26:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:26:17,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:26:17,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:26:17,041 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 07:26:17,041 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 79 transitions. cyclomatic complexity: 16 Second operand 4 states. [2018-11-10 07:26:17,059 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 79 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 88 states and 104 transitions. Complement of second has 7 states. [2018-11-10 07:26:17,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:26:17,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 07:26:17,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2018-11-10 07:26:17,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 24 letters. Loop has 5 letters. [2018-11-10 07:26:17,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:26:17,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 29 letters. Loop has 5 letters. [2018-11-10 07:26:17,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:26:17,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 24 letters. Loop has 10 letters. [2018-11-10 07:26:17,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:26:17,062 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 104 transitions. [2018-11-10 07:26:17,062 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-10 07:26:17,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 71 states and 83 transitions. [2018-11-10 07:26:17,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2018-11-10 07:26:17,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-10 07:26:17,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 83 transitions. [2018-11-10 07:26:17,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:26:17,063 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 83 transitions. [2018-11-10 07:26:17,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 83 transitions. [2018-11-10 07:26:17,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-11-10 07:26:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 07:26:17,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2018-11-10 07:26:17,067 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 82 transitions. [2018-11-10 07:26:17,067 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 82 transitions. [2018-11-10 07:26:17,068 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 07:26:17,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 82 transitions. [2018-11-10 07:26:17,068 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-10 07:26:17,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:26:17,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:26:17,069 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:26:17,069 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:26:17,069 INFO L793 eck$LassoCheckResult]: Stem: 1140#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1119#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1120#L23 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1096#L9-4 assume true; 1097#L9-1 assume !!(sep_~i~0 < ~N~0); 1161#L11 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11 1139#L11-1 assume !((if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0);havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1104#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 1098#L9-4 assume true; 1099#L9-1 assume !!(sep_~i~0 < ~N~0); 1159#L11 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11 1158#L11-1 assume (if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0;havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := sep_#t~post2 + 1;havoc sep_#t~post2; 1155#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 1152#L9-4 assume true; 1151#L9-1 assume !(sep_~i~0 < ~N~0); 1130#L9-5 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1131#L16 main_#t~ret5 := sep_#res;assume { :end_inline_sep } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5; 1150#L32 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L32 1149#L32-1 main_~temp~0 := main_#t~mem6;havoc main_#t~mem6; 1148#L32-2 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L32-2 1147#L32-3 SUMMARY for call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L32-3 1134#L32-4 havoc main_#t~mem7; 1133#L32-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L32-5 1132#L32-6 assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1115#L9-10 assume true; 1117#L9-7 assume !(sep_~i~0 < ~N~0); 1123#L9-11 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1092#L16-1 main_#t~ret8 := sep_#res;assume { :end_inline_sep } true;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8; 1093#L34 SUMMARY for call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L34 1121#L34-1 main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1122#L35-4 [2018-11-10 07:26:17,069 INFO L795 eck$LassoCheckResult]: Loop: 1122#L35-4 assume true; 1138#L35-1 assume !!(main_~i~1 < ~N~0 - 1); 1128#L36 SUMMARY for call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + (main_~i~1 + 1) * 4, 4); srcloc: L36 1127#L36-1 SUMMARY for call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L36-1 1125#L36-2 havoc main_#t~mem11; 1126#L35-3 main_#t~post10 := main_~i~1;main_~i~1 := main_#t~post10 + 1;havoc main_#t~post10; 1122#L35-4 [2018-11-10 07:26:17,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:17,070 INFO L82 PathProgramCache]: Analyzing trace with hash -2085613955, now seen corresponding path program 1 times [2018-11-10 07:26:17,070 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:17,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:17,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:17,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:26:17,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:26:17,109 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 07:26:17,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:26:17,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 07:26:17,110 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:26:17,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:17,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1509319095, now seen corresponding path program 1 times [2018-11-10 07:26:17,110 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:17,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:17,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:17,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:26:17,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:17,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 07:26:17,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 07:26:17,157 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. cyclomatic complexity: 17 Second operand 4 states. [2018-11-10 07:26:17,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:26:17,177 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2018-11-10 07:26:17,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 07:26:17,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 93 transitions. [2018-11-10 07:26:17,178 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-10 07:26:17,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 79 states and 91 transitions. [2018-11-10 07:26:17,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2018-11-10 07:26:17,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2018-11-10 07:26:17,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 91 transitions. [2018-11-10 07:26:17,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:26:17,179 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 91 transitions. [2018-11-10 07:26:17,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 91 transitions. [2018-11-10 07:26:17,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2018-11-10 07:26:17,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 07:26:17,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2018-11-10 07:26:17,182 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 80 transitions. [2018-11-10 07:26:17,182 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 80 transitions. [2018-11-10 07:26:17,182 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 07:26:17,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 80 transitions. [2018-11-10 07:26:17,183 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-10 07:26:17,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:26:17,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:26:17,184 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:26:17,184 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:26:17,184 INFO L793 eck$LassoCheckResult]: Stem: 1296#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1270#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1271#L23 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1251#L9-4 assume true; 1252#L9-1 assume !!(sep_~i~0 < ~N~0); 1304#L11 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11 1302#L11-1 assume !((if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0);havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1259#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 1253#L9-4 assume true; 1254#L9-1 assume !!(sep_~i~0 < ~N~0); 1317#L11 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11 1316#L11-1 assume (if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0;havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := sep_#t~post2 + 1;havoc sep_#t~post2; 1295#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 1314#L9-4 assume true; 1313#L9-1 assume !(sep_~i~0 < ~N~0); 1312#L9-5 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1311#L16 main_#t~ret5 := sep_#res;assume { :end_inline_sep } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5; 1278#L32 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L32 1272#L32-1 main_~temp~0 := main_#t~mem6;havoc main_#t~mem6; 1273#L32-2 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L32-2 1292#L32-3 SUMMARY for call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L32-3 1290#L32-4 havoc main_#t~mem7; 1289#L32-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L32-5 1288#L32-6 assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1274#L9-10 assume true; 1275#L9-7 assume !!(sep_~i~0 < ~N~0); 1282#L11-3 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11-3 1297#L11-4 assume !((if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0);havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1263#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 1276#L9-10 assume true; 1277#L9-7 assume !(sep_~i~0 < ~N~0); 1281#L9-11 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1249#L16-1 main_#t~ret8 := sep_#res;assume { :end_inline_sep } true;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8; 1250#L34 SUMMARY for call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L34 1279#L34-1 main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1280#L35-4 [2018-11-10 07:26:17,184 INFO L795 eck$LassoCheckResult]: Loop: 1280#L35-4 assume true; 1293#L35-1 assume !!(main_~i~1 < ~N~0 - 1); 1286#L36 SUMMARY for call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + (main_~i~1 + 1) * 4, 4); srcloc: L36 1285#L36-1 SUMMARY for call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L36-1 1283#L36-2 havoc main_#t~mem11; 1284#L35-3 main_#t~post10 := main_~i~1;main_~i~1 := main_#t~post10 + 1;havoc main_#t~post10; 1280#L35-4 [2018-11-10 07:26:17,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:17,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1168639207, now seen corresponding path program 1 times [2018-11-10 07:26:17,184 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:17,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:17,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:17,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:26:17,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:26:17,223 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 07:26:17,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:26:17,223 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_068b63ef-7998-458e-885a-23bd7c336c08/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:26:17,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:26:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:26:17,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:26:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 07:26:17,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:26:17,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-10 07:26:17,302 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:26:17,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:17,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1509319095, now seen corresponding path program 2 times [2018-11-10 07:26:17,302 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:17,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:17,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:17,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:26:17,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:17,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 07:26:17,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-10 07:26:17,338 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. cyclomatic complexity: 15 Second operand 7 states. [2018-11-10 07:26:17,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:26:17,393 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2018-11-10 07:26:17,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 07:26:17,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 106 transitions. [2018-11-10 07:26:17,394 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-10 07:26:17,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 91 states and 105 transitions. [2018-11-10 07:26:17,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-10 07:26:17,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-10 07:26:17,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 105 transitions. [2018-11-10 07:26:17,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:26:17,395 INFO L705 BuchiCegarLoop]: Abstraction has 91 states and 105 transitions. [2018-11-10 07:26:17,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 105 transitions. [2018-11-10 07:26:17,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 75. [2018-11-10 07:26:17,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-10 07:26:17,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2018-11-10 07:26:17,398 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 86 transitions. [2018-11-10 07:26:17,398 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 86 transitions. [2018-11-10 07:26:17,398 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 07:26:17,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 86 transitions. [2018-11-10 07:26:17,399 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-10 07:26:17,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:26:17,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:26:17,402 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:26:17,402 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:26:17,403 INFO L793 eck$LassoCheckResult]: Stem: 1572#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1545#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1546#L23 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1527#L9-4 assume true; 1528#L9-1 assume !!(sep_~i~0 < ~N~0); 1599#L11 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11 1571#L11-1 assume !((if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0);havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1535#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 1529#L9-4 assume true; 1530#L9-1 assume !!(sep_~i~0 < ~N~0); 1542#L11 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11 1573#L11-1 assume (if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0;havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := sep_#t~post2 + 1;havoc sep_#t~post2; 1593#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 1591#L9-4 assume true; 1590#L9-1 assume !(sep_~i~0 < ~N~0); 1562#L9-5 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1533#L16 main_#t~ret5 := sep_#res;assume { :end_inline_sep } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5; 1534#L32 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L32 1586#L32-1 main_~temp~0 := main_#t~mem6;havoc main_#t~mem6; 1585#L32-2 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L32-2 1584#L32-3 SUMMARY for call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L32-3 1583#L32-4 havoc main_#t~mem7; 1582#L32-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L32-5 1581#L32-6 assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1580#L9-10 assume true; 1579#L9-7 assume !!(sep_~i~0 < ~N~0); 1577#L11-3 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11-3 1575#L11-4 assume !((if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0);havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1574#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 1551#L9-10 assume true; 1552#L9-7 assume !!(sep_~i~0 < ~N~0); 1543#L11-3 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11-3 1538#L11-4 assume !((if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0);havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1539#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 1554#L9-10 assume true; 1557#L9-7 assume !(sep_~i~0 < ~N~0); 1558#L9-11 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1525#L16-1 main_#t~ret8 := sep_#res;assume { :end_inline_sep } true;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8; 1526#L34 SUMMARY for call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L34 1555#L34-1 main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1556#L35-4 [2018-11-10 07:26:17,403 INFO L795 eck$LassoCheckResult]: Loop: 1556#L35-4 assume true; 1570#L35-1 assume !!(main_~i~1 < ~N~0 - 1); 1563#L36 SUMMARY for call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + (main_~i~1 + 1) * 4, 4); srcloc: L36 1561#L36-1 SUMMARY for call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L36-1 1559#L36-2 havoc main_#t~mem11; 1560#L35-3 main_#t~post10 := main_~i~1;main_~i~1 := main_#t~post10 + 1;havoc main_#t~post10; 1556#L35-4 [2018-11-10 07:26:17,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:17,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1442287613, now seen corresponding path program 2 times [2018-11-10 07:26:17,403 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:17,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:17,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:17,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:26:17,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:26:17,654 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 07:26:17,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:26:17,655 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_068b63ef-7998-458e-885a-23bd7c336c08/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:26:17,665 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 07:26:17,683 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 07:26:17,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:26:17,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:26:17,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-11-10 07:26:17,780 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:26:17,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 39 [2018-11-10 07:26:17,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:26:17,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:26:17,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:26:17,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2018-11-10 07:26:17,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2018-11-10 07:26:17,809 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:26:17,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-11-10 07:26:17,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:26:17,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:26:17,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:26:17,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:19 [2018-11-10 07:26:17,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-11-10 07:26:17,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2018-11-10 07:26:17,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:26:17,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:26:17,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:26:17,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:7 [2018-11-10 07:26:17,870 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 07:26:17,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:26:17,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2018-11-10 07:26:17,897 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:26:17,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:17,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1509319095, now seen corresponding path program 3 times [2018-11-10 07:26:17,898 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:17,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:17,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:17,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:26:17,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:17,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 07:26:17,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-11-10 07:26:17,949 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. cyclomatic complexity: 16 Second operand 19 states. [2018-11-10 07:26:18,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:26:18,483 INFO L93 Difference]: Finished difference Result 114 states and 131 transitions. [2018-11-10 07:26:18,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 07:26:18,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 131 transitions. [2018-11-10 07:26:18,484 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-10 07:26:18,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 114 states and 131 transitions. [2018-11-10 07:26:18,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2018-11-10 07:26:18,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2018-11-10 07:26:18,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 131 transitions. [2018-11-10 07:26:18,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:26:18,485 INFO L705 BuchiCegarLoop]: Abstraction has 114 states and 131 transitions. [2018-11-10 07:26:18,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 131 transitions. [2018-11-10 07:26:18,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 75. [2018-11-10 07:26:18,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-10 07:26:18,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2018-11-10 07:26:18,490 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-11-10 07:26:18,490 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-11-10 07:26:18,490 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 07:26:18,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 85 transitions. [2018-11-10 07:26:18,490 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-10 07:26:18,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:26:18,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:26:18,491 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:26:18,491 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:26:18,491 INFO L793 eck$LassoCheckResult]: Stem: 1937#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1906#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1907#L23 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1885#L9-4 assume true; 1886#L9-1 assume !!(sep_~i~0 < ~N~0); 1945#L11 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11 1944#L11-1 assume !((if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0);havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1943#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 1887#L9-4 assume true; 1888#L9-1 assume !!(sep_~i~0 < ~N~0); 1900#L11 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11 1954#L11-1 assume (if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0;havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := sep_#t~post2 + 1;havoc sep_#t~post2; 1953#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 1940#L9-4 assume true; 1941#L9-1 assume !(sep_~i~0 < ~N~0); 1922#L9-5 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1923#L16 main_#t~ret5 := sep_#res;assume { :end_inline_sep } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5; 1911#L32 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L32 1912#L32-1 main_~temp~0 := main_#t~mem6;havoc main_#t~mem6; 1933#L32-2 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L32-2 1934#L32-3 SUMMARY for call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L32-3 1929#L32-4 havoc main_#t~mem7; 1930#L32-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L32-5 1924#L32-6 assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1925#L9-10 assume true; 1951#L9-7 assume !!(sep_~i~0 < ~N~0); 1949#L11-3 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11-3 1947#L11-4 assume (if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0;havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := sep_#t~post2 + 1;havoc sep_#t~post2; 1910#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 1904#L9-10 assume true; 1905#L9-7 assume !!(sep_~i~0 < ~N~0); 1897#L11-3 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11-3 1895#L11-4 assume !((if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0);havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1896#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 1946#L9-10 assume true; 1915#L9-7 assume !(sep_~i~0 < ~N~0); 1916#L9-11 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1881#L16-1 main_#t~ret8 := sep_#res;assume { :end_inline_sep } true;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8; 1882#L34 SUMMARY for call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L34 1913#L34-1 main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1914#L35-4 [2018-11-10 07:26:18,491 INFO L795 eck$LassoCheckResult]: Loop: 1914#L35-4 assume true; 1935#L35-1 assume !!(main_~i~1 < ~N~0 - 1); 1920#L36 SUMMARY for call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + (main_~i~1 + 1) * 4, 4); srcloc: L36 1919#L36-1 SUMMARY for call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L36-1 1917#L36-2 havoc main_#t~mem11; 1918#L35-3 main_#t~post10 := main_~i~1;main_~i~1 := main_#t~post10 + 1;havoc main_#t~post10; 1914#L35-4 [2018-11-10 07:26:18,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:18,492 INFO L82 PathProgramCache]: Analyzing trace with hash 2029093627, now seen corresponding path program 1 times [2018-11-10 07:26:18,492 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:18,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:18,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:18,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:26:18,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:18,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:18,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1509319095, now seen corresponding path program 4 times [2018-11-10 07:26:18,521 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:18,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:18,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:18,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:26:18,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:18,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:18,525 INFO L82 PathProgramCache]: Analyzing trace with hash 2032631235, now seen corresponding path program 1 times [2018-11-10 07:26:18,525 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:18,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:18,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:18,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:26:18,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:19,029 WARN L179 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 181 [2018-11-10 07:26:19,326 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 88 [2018-11-10 07:26:19,327 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:26:19,327 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:26:19,327 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:26:19,327 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:26:19,327 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:26:19,327 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:26:19,327 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:26:19,327 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:26:19,327 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep_true-unreach-call_true-termination.i_Iteration9_Lasso [2018-11-10 07:26:19,327 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:26:19,328 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:26:19,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:19,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:19,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:19,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:19,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:19,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:19,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:19,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:19,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:19,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:19,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:19,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:19,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:19,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:19,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:19,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:19,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:19,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:19,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:19,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:19,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:19,801 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:26:19,801 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:26:19,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-11-10 07:26:19,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:19,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:19,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:19,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:19,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:19,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:19,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:19,803 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:19,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:19,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:19,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:19,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:19,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:19,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:19,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:19,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:19,804 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:19,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:19,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:19,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:19,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:19,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:19,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:19,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:19,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:19,805 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:19,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:19,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:19,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:19,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:19,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:19,806 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:26:19,806 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:26:19,806 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:19,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-11-10 07:26:19,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:19,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:19,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:19,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:19,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:19,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:19,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:19,807 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:19,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-11-10 07:26:19,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:19,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:19,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:19,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:19,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:19,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:19,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:19,808 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:19,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-11-10 07:26:19,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:19,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:19,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:19,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:19,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:19,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:19,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:19,809 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:19,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-11-10 07:26:19,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:19,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:19,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:19,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:19,810 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:26:19,810 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:26:19,812 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:19,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:19,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:19,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:19,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:19,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:19,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:19,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:19,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:19,813 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:19,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:19,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:19,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:19,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:19,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:19,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:19,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:19,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:19,813 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:19,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-11-10 07:26:19,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:19,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:19,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:19,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:19,814 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:26:19,814 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:26:19,815 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:19,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:19,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:19,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:19,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:19,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:19,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:19,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:19,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:19,816 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:19,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:19,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:19,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:19,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:19,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:19,817 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:26:19,817 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:26:19,820 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:19,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:19,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:19,821 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 07:26:19,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:19,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:19,822 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 07:26:19,822 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:26:19,826 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:19,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:19,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:19,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:19,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:19,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:19,828 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:26:19,828 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:26:19,831 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:19,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:19,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:19,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:19,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:19,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:19,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:26:19,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:26:19,848 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:26:19,858 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 07:26:19,858 INFO L444 ModelExtractionUtils]: 22 out of 31 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-10 07:26:19,858 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:26:19,859 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:26:19,859 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:26:19,859 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ~N~0) = -1*ULTIMATE.start_main_~i~1 + 1*~N~0 Supporting invariants [] [2018-11-10 07:26:19,899 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-10 07:26:19,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:26:19,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:26:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:26:19,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:26:19,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:26:19,944 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 07:26:19,945 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 85 transitions. cyclomatic complexity: 15 Second operand 4 states. [2018-11-10 07:26:19,959 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 85 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 88 states and 101 transitions. Complement of second has 6 states. [2018-11-10 07:26:19,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:26:19,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 07:26:19,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2018-11-10 07:26:19,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 40 letters. Loop has 6 letters. [2018-11-10 07:26:19,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:26:19,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 46 letters. Loop has 6 letters. [2018-11-10 07:26:19,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:26:19,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 40 letters. Loop has 12 letters. [2018-11-10 07:26:19,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:26:19,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 101 transitions. [2018-11-10 07:26:19,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 07:26:19,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 77 states and 88 transitions. [2018-11-10 07:26:19,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-11-10 07:26:19,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-10 07:26:19,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 88 transitions. [2018-11-10 07:26:19,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:26:19,963 INFO L705 BuchiCegarLoop]: Abstraction has 77 states and 88 transitions. [2018-11-10 07:26:19,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 88 transitions. [2018-11-10 07:26:19,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-10 07:26:19,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-10 07:26:19,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2018-11-10 07:26:19,965 INFO L728 BuchiCegarLoop]: Abstraction has 77 states and 88 transitions. [2018-11-10 07:26:19,965 INFO L608 BuchiCegarLoop]: Abstraction has 77 states and 88 transitions. [2018-11-10 07:26:19,965 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 07:26:19,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 88 transitions. [2018-11-10 07:26:19,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 07:26:19,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:26:19,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:26:19,967 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:26:19,967 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 07:26:19,967 INFO L793 eck$LassoCheckResult]: Stem: 2299#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 2275#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 2276#L23 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 2253#L9-4 assume true; 2254#L9-1 assume !!(sep_~i~0 < ~N~0); 2267#L11 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11 2298#L11-1 assume !((if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0);havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 2261#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 2255#L9-4 assume true; 2256#L9-1 assume !!(sep_~i~0 < ~N~0); 2325#L11 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11 2320#L11-1 assume (if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0;havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := sep_#t~post2 + 1;havoc sep_#t~post2; 2318#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 2316#L9-4 assume true; 2315#L9-1 assume !(sep_~i~0 < ~N~0); 2312#L9-5 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 2311#L16 main_#t~ret5 := sep_#res;assume { :end_inline_sep } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5; 2310#L32 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L32 2269#L32-1 main_~temp~0 := main_#t~mem6;havoc main_#t~mem6; 2270#L32-2 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L32-2 2294#L32-3 SUMMARY for call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L32-3 2290#L32-4 havoc main_#t~mem7; 2289#L32-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L32-5 2288#L32-6 assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 2271#L9-10 assume true; 2272#L9-7 assume !!(sep_~i~0 < ~N~0); 2304#L11-3 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11-3 2301#L11-4 assume (if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0;havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := sep_#t~post2 + 1;havoc sep_#t~post2; 2278#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 2273#L9-10 assume true; 2274#L9-7 assume !!(sep_~i~0 < ~N~0); 2264#L11-3 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11-3 2262#L11-4 assume !((if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0);havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 2263#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 2300#L9-10 assume true; 2281#L9-7 assume !(sep_~i~0 < ~N~0); 2282#L9-11 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 2249#L16-1 main_#t~ret8 := sep_#res;assume { :end_inline_sep } true;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8; 2250#L34 SUMMARY for call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L34 2279#L34-1 main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 2280#L35-4 assume true; 2296#L35-1 assume !(main_~i~1 < ~N~0 - 1); 2268#L35-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + (~N~0 - 1) * 4, 4); srcloc: L35-5 2259#L38 assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 2260#L9-16 [2018-11-10 07:26:19,967 INFO L795 eck$LassoCheckResult]: Loop: 2260#L9-16 assume true; 2291#L9-13 assume !!(sep_~i~0 < ~N~0); 2251#L11-6 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11-6 2252#L11-7 assume (if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0;havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := sep_#t~post2 + 1;havoc sep_#t~post2; 2287#L9-15 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 2260#L9-16 [2018-11-10 07:26:19,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:19,967 INFO L82 PathProgramCache]: Analyzing trace with hash -833639809, now seen corresponding path program 1 times [2018-11-10 07:26:19,967 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:19,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:19,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:19,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:26:19,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:26:20,006 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 07:26:20,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:26:20,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 07:26:20,006 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:26:20,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:20,006 INFO L82 PathProgramCache]: Analyzing trace with hash 107991479, now seen corresponding path program 1 times [2018-11-10 07:26:20,007 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:20,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:20,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:20,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:26:20,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:20,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 07:26:20,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 07:26:20,055 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. cyclomatic complexity: 16 Second operand 4 states. [2018-11-10 07:26:20,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:26:20,072 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-11-10 07:26:20,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 07:26:20,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 93 transitions. [2018-11-10 07:26:20,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 07:26:20,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 82 states and 92 transitions. [2018-11-10 07:26:20,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-10 07:26:20,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-10 07:26:20,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 92 transitions. [2018-11-10 07:26:20,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:26:20,075 INFO L705 BuchiCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-11-10 07:26:20,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 92 transitions. [2018-11-10 07:26:20,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2018-11-10 07:26:20,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-10 07:26:20,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-11-10 07:26:20,077 INFO L728 BuchiCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-11-10 07:26:20,077 INFO L608 BuchiCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-11-10 07:26:20,077 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 07:26:20,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 87 transitions. [2018-11-10 07:26:20,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 07:26:20,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:26:20,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:26:20,079 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:26:20,079 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 07:26:20,079 INFO L793 eck$LassoCheckResult]: Stem: 2469#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 2438#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 2439#L23 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 2418#L9-4 assume true; 2419#L9-1 assume !!(sep_~i~0 < ~N~0); 2477#L11 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11 2468#L11-1 assume !((if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0);havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 2426#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 2420#L9-4 assume true; 2421#L9-1 assume !!(sep_~i~0 < ~N~0); 2492#L11 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11 2489#L11-1 assume (if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0;havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := sep_#t~post2 + 1;havoc sep_#t~post2; 2488#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 2486#L9-4 assume true; 2485#L9-1 assume !(sep_~i~0 < ~N~0); 2484#L9-5 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 2483#L16 main_#t~ret5 := sep_#res;assume { :end_inline_sep } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5; 2482#L32 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L32 2481#L32-1 main_~temp~0 := main_#t~mem6;havoc main_#t~mem6; 2463#L32-2 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L32-2 2464#L32-3 SUMMARY for call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L32-3 2459#L32-4 havoc main_#t~mem7; 2457#L32-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L32-5 2458#L32-6 assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 2442#L9-10 assume true; 2443#L9-7 assume !!(sep_~i~0 < ~N~0); 2435#L11-3 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11-3 2436#L11-4 assume (if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0;havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := sep_#t~post2 + 1;havoc sep_#t~post2; 2430#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 2444#L9-10 assume true; 2445#L9-7 assume !!(sep_~i~0 < ~N~0); 2474#L11-3 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11-3 2473#L11-4 assume !((if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0);havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 2472#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 2471#L9-10 assume true; 2448#L9-7 assume !(sep_~i~0 < ~N~0); 2449#L9-11 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 2416#L16-1 main_#t~ret8 := sep_#res;assume { :end_inline_sep } true;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8; 2417#L34 SUMMARY for call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L34 2446#L34-1 main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 2447#L35-4 assume true; 2465#L35-1 assume !!(main_~i~1 < ~N~0 - 1); 2453#L36 SUMMARY for call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + (main_~i~1 + 1) * 4, 4); srcloc: L36 2452#L36-1 SUMMARY for call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L36-1 2450#L36-2 havoc main_#t~mem11; 2451#L35-3 main_#t~post10 := main_~i~1;main_~i~1 := main_#t~post10 + 1;havoc main_#t~post10; 2466#L35-4 assume true; 2467#L35-1 assume !(main_~i~1 < ~N~0 - 1); 2437#L35-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + (~N~0 - 1) * 4, 4); srcloc: L35-5 2427#L38 assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 2428#L9-16 [2018-11-10 07:26:20,079 INFO L795 eck$LassoCheckResult]: Loop: 2428#L9-16 assume true; 2460#L9-13 assume !!(sep_~i~0 < ~N~0); 2422#L11-6 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11-6 2423#L11-7 assume (if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0;havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := sep_#t~post2 + 1;havoc sep_#t~post2; 2454#L9-15 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 2428#L9-16 [2018-11-10 07:26:20,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:20,079 INFO L82 PathProgramCache]: Analyzing trace with hash 2046492999, now seen corresponding path program 1 times [2018-11-10 07:26:20,079 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:20,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:20,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:20,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:26:20,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:20,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:20,144 INFO L82 PathProgramCache]: Analyzing trace with hash 107991479, now seen corresponding path program 2 times [2018-11-10 07:26:20,144 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:20,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:20,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:20,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:26:20,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:20,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:20,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1113543631, now seen corresponding path program 1 times [2018-11-10 07:26:20,151 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:20,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:20,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:20,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:26:20,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:20,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:26:20,817 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 07:26:20,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:26:20,817 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_068b63ef-7998-458e-885a-23bd7c336c08/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:26:20,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:26:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:26:20,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:26:20,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-10 07:26:20,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2018-11-10 07:26:20,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:26:20,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:26:20,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:26:20,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-11-10 07:26:20,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 07:26:20,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 07:26:20,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:26:20,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:26:20,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:26:20,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-11-10 07:26:21,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 07:26:21,023 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:26:21,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 32 [2018-11-10 07:26:21,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:26:21,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:26:21,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:26:21,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-11-10 07:26:21,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2018-11-10 07:26:21,059 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:26:21,060 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:26:21,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 61 [2018-11-10 07:26:21,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 07:26:21,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 07:26:21,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 07:26:21,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:37 [2018-11-10 07:26:21,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-10 07:26:21,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2018-11-10 07:26:21,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:26:21,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:26:21,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:26:21,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:6 [2018-11-10 07:26:21,180 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 07:26:21,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:26:21,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14] total 33 [2018-11-10 07:26:21,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-10 07:26:21,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2018-11-10 07:26:21,228 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. cyclomatic complexity: 15 Second operand 33 states. [2018-11-10 07:26:34,690 WARN L179 SmtUtils]: Spent 12.06 s on a formula simplification. DAG size of input: 71 DAG size of output: 35 [2018-11-10 07:26:35,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:26:35,601 INFO L93 Difference]: Finished difference Result 278 states and 310 transitions. [2018-11-10 07:26:35,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-10 07:26:35,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 278 states and 310 transitions. [2018-11-10 07:26:35,602 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2018-11-10 07:26:35,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 278 states to 278 states and 310 transitions. [2018-11-10 07:26:35,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 143 [2018-11-10 07:26:35,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 143 [2018-11-10 07:26:35,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 278 states and 310 transitions. [2018-11-10 07:26:35,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:26:35,603 INFO L705 BuchiCegarLoop]: Abstraction has 278 states and 310 transitions. [2018-11-10 07:26:35,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states and 310 transitions. [2018-11-10 07:26:35,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 197. [2018-11-10 07:26:35,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-10 07:26:35,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 220 transitions. [2018-11-10 07:26:35,606 INFO L728 BuchiCegarLoop]: Abstraction has 197 states and 220 transitions. [2018-11-10 07:26:35,606 INFO L608 BuchiCegarLoop]: Abstraction has 197 states and 220 transitions. [2018-11-10 07:26:35,606 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 07:26:35,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 197 states and 220 transitions. [2018-11-10 07:26:35,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 07:26:35,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:26:35,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:26:35,607 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:26:35,607 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 07:26:35,607 INFO L793 eck$LassoCheckResult]: Stem: 3114#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 3085#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 3086#L23 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 3065#L9-4 assume true; 3066#L9-1 assume !!(sep_~i~0 < ~N~0); 3194#L11 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11 3192#L11-1 assume (if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0;havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := sep_#t~post2 + 1;havoc sep_#t~post2; 3191#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 3190#L9-4 assume true; 3189#L9-1 assume !!(sep_~i~0 < ~N~0); 3188#L11 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11 3183#L11-1 assume (if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0;havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := sep_#t~post2 + 1;havoc sep_#t~post2; 3181#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 3177#L9-4 assume true; 3175#L9-1 assume !(sep_~i~0 < ~N~0); 3173#L9-5 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 3171#L16 main_#t~ret5 := sep_#res;assume { :end_inline_sep } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5; 3169#L32 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L32 3167#L32-1 main_~temp~0 := main_#t~mem6;havoc main_#t~mem6; 3165#L32-2 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L32-2 3163#L32-3 SUMMARY for call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L32-3 3161#L32-4 havoc main_#t~mem7; 3159#L32-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L32-5 3157#L32-6 assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 3155#L9-10 assume true; 3153#L9-7 assume !!(sep_~i~0 < ~N~0); 3151#L11-3 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11-3 3149#L11-4 assume (if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0;havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := sep_#t~post2 + 1;havoc sep_#t~post2; 3148#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 3147#L9-10 assume true; 3143#L9-7 assume !!(sep_~i~0 < ~N~0); 3146#L11-3 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11-3 3145#L11-4 assume !((if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0);havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 3144#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 3142#L9-10 assume true; 3141#L9-7 assume !(sep_~i~0 < ~N~0); 3140#L9-11 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 3138#L16-1 main_#t~ret8 := sep_#res;assume { :end_inline_sep } true;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8; 3136#L34 SUMMARY for call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L34 3134#L34-1 main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 3132#L35-4 assume true; 3127#L35-1 assume !!(main_~i~1 < ~N~0 - 1); 3131#L36 SUMMARY for call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + (main_~i~1 + 1) * 4, 4); srcloc: L36 3130#L36-1 SUMMARY for call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L36-1 3129#L36-2 havoc main_#t~mem11; 3128#L35-3 main_#t~post10 := main_~i~1;main_~i~1 := main_#t~post10 + 1;havoc main_#t~post10; 3126#L35-4 assume true; 3125#L35-1 assume !(main_~i~1 < ~N~0 - 1); 3124#L35-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + (~N~0 - 1) * 4, 4); srcloc: L35-5 3123#L38 assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 3105#L9-16 [2018-11-10 07:26:35,607 INFO L795 eck$LassoCheckResult]: Loop: 3105#L9-16 assume true; 3122#L9-13 assume !!(sep_~i~0 < ~N~0); 3121#L11-6 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11-6 3120#L11-7 assume (if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0;havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := sep_#t~post2 + 1;havoc sep_#t~post2; 3103#L9-15 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 3105#L9-16 [2018-11-10 07:26:35,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:35,607 INFO L82 PathProgramCache]: Analyzing trace with hash -199086455, now seen corresponding path program 1 times [2018-11-10 07:26:35,607 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:35,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:35,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:35,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:26:35,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:26:36,036 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:26:36,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:26:36,036 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_068b63ef-7998-458e-885a-23bd7c336c08/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:26:36,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:26:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:26:36,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:26:36,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 07:26:36,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 07:26:36,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:26:36,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:26:36,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:26:36,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:5 [2018-11-10 07:26:36,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 07:26:36,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 07:26:36,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:26:36,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:26:36,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:26:36,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-11-10 07:26:36,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-10 07:26:36,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-11-10 07:26:36,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:26:36,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:26:36,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:26:36,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-11-10 07:26:36,201 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 07:26:36,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:26:36,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 28 [2018-11-10 07:26:36,217 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:26:36,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:36,218 INFO L82 PathProgramCache]: Analyzing trace with hash 107991479, now seen corresponding path program 3 times [2018-11-10 07:26:36,218 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:36,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:36,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:36,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:26:36,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:36,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-10 07:26:36,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2018-11-10 07:26:36,262 INFO L87 Difference]: Start difference. First operand 197 states and 220 transitions. cyclomatic complexity: 33 Second operand 28 states. [2018-11-10 07:26:37,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:26:37,934 INFO L93 Difference]: Finished difference Result 355 states and 394 transitions. [2018-11-10 07:26:37,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-10 07:26:37,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 355 states and 394 transitions. [2018-11-10 07:26:37,935 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 07:26:37,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 355 states to 353 states and 392 transitions. [2018-11-10 07:26:37,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 166 [2018-11-10 07:26:37,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 166 [2018-11-10 07:26:37,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 353 states and 392 transitions. [2018-11-10 07:26:37,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:26:37,938 INFO L705 BuchiCegarLoop]: Abstraction has 353 states and 392 transitions. [2018-11-10 07:26:37,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states and 392 transitions. [2018-11-10 07:26:37,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 244. [2018-11-10 07:26:37,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-11-10 07:26:37,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 271 transitions. [2018-11-10 07:26:37,944 INFO L728 BuchiCegarLoop]: Abstraction has 244 states and 271 transitions. [2018-11-10 07:26:37,944 INFO L608 BuchiCegarLoop]: Abstraction has 244 states and 271 transitions. [2018-11-10 07:26:37,944 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 07:26:37,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 244 states and 271 transitions. [2018-11-10 07:26:37,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 07:26:37,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:26:37,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:26:37,946 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:26:37,946 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 07:26:37,946 INFO L793 eck$LassoCheckResult]: Stem: 3950#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 3909#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 3910#L23 assume ~N~0 > 1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := ~N~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 3885#L9-4 assume true; 3886#L9-1 assume !!(sep_~i~0 < ~N~0); 4040#L11 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11 4038#L11-1 assume (if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0;havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := sep_#t~post2 + 1;havoc sep_#t~post2; 4039#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 3887#L9-4 assume true; 3888#L9-1 assume !!(sep_~i~0 < ~N~0); 4097#L11 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11 4094#L11-1 assume (if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0;havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := sep_#t~post2 + 1;havoc sep_#t~post2; 4095#L9-3 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 4067#L9-4 assume true; 4068#L9-1 assume !(sep_~i~0 < ~N~0); 3929#L9-5 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 3930#L16 main_#t~ret5 := sep_#res;assume { :end_inline_sep } true;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5; 3915#L32 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L32 3916#L32-1 main_~temp~0 := main_#t~mem6;havoc main_#t~mem6; 3940#L32-2 SUMMARY for call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L32-2 3941#L32-3 SUMMARY for call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L32-3 3935#L32-4 havoc main_#t~mem7; 3936#L32-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L32-5 3931#L32-6 assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 3932#L9-10 assume true; 4076#L9-7 assume !!(sep_~i~0 < ~N~0); 4077#L11-3 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11-3 4072#L11-4 assume (if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0;havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := sep_#t~post2 + 1;havoc sep_#t~post2; 3913#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 3914#L9-10 assume true; 4108#L9-7 assume !!(sep_~i~0 < ~N~0); 4107#L11-3 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11-3 4106#L11-4 assume (if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0;havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := sep_#t~post2 + 1;havoc sep_#t~post2; 4070#L9-9 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 4071#L9-10 assume true; 3919#L9-7 assume !(sep_~i~0 < ~N~0); 3920#L9-11 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 3881#L16-1 main_#t~ret8 := sep_#res;assume { :end_inline_sep } true;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8; 3882#L34 SUMMARY for call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L34 3917#L34-1 main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 3918#L35-4 assume true; 3957#L35-1 assume !!(main_~i~1 < ~N~0 - 1); 3961#L36 SUMMARY for call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + (main_~i~1 + 1) * 4, 4); srcloc: L36 3960#L36-1 SUMMARY for call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L36-1 3959#L36-2 havoc main_#t~mem11; 3958#L35-3 main_#t~post10 := main_~i~1;main_~i~1 := main_#t~post10 + 1;havoc main_#t~post10; 3956#L35-4 assume true; 3951#L35-1 assume !(main_~i~1 < ~N~0 - 1); 3952#L35-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + (~N~0 - 1) * 4, 4); srcloc: L35-5 3891#L38 assume { :begin_inline_sep } true;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 3892#L9-16 [2018-11-10 07:26:37,946 INFO L795 eck$LassoCheckResult]: Loop: 3892#L9-16 assume true; 3937#L9-13 assume !!(sep_~i~0 < ~N~0); 3883#L11-6 SUMMARY for call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + sep_~i~0 * 4, 4); srcloc: L11-6 3884#L11-7 assume (if sep_#t~mem1 < 0 && sep_#t~mem1 % 2 != 0 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2) == 0;havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := sep_#t~post2 + 1;havoc sep_#t~post2; 3928#L9-15 sep_#t~post0 := sep_~i~0;sep_~i~0 := sep_#t~post0 + 1;havoc sep_#t~post0; 3892#L9-16 [2018-11-10 07:26:37,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:37,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1795058251, now seen corresponding path program 1 times [2018-11-10 07:26:37,947 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:37,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:37,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:37,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:26:37,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:37,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:37,972 INFO L82 PathProgramCache]: Analyzing trace with hash 107991479, now seen corresponding path program 4 times [2018-11-10 07:26:37,972 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:37,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:37,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:37,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:26:37,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:37,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:37,975 INFO L82 PathProgramCache]: Analyzing trace with hash 707413421, now seen corresponding path program 1 times [2018-11-10 07:26:37,976 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:26:37,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:26:37,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:37,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:26:37,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:26:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:26:38,976 WARN L179 SmtUtils]: Spent 917.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 215 [2018-11-10 07:26:39,295 WARN L179 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2018-11-10 07:26:39,296 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:26:39,296 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:26:39,296 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:26:39,296 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:26:39,296 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:26:39,296 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:26:39,296 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:26:39,296 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:26:39,296 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep_true-unreach-call_true-termination.i_Iteration13_Lasso [2018-11-10 07:26:39,296 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:26:39,296 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:26:39,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:39,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:39,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:39,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:39,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:39,450 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2018-11-10 07:26:39,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:39,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:39,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:39,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:39,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:39,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:39,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:39,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:39,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:39,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:39,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:39,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:39,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:39,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:39,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:39,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:39,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:26:39,760 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:26:39,760 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:26:39,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:39,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:39,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:39,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:39,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:39,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:39,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:39,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:39,762 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:39,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:39,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:39,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:39,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:39,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:39,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:39,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:39,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:39,763 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:39,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:39,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:39,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:26:39,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:39,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:39,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:39,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:26:39,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:26:39,773 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:39,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:39,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:39,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:39,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:39,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:39,774 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:26:39,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:26:39,774 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:39,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:39,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:39,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:39,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:39,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:39,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:26:39,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:26:39,776 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:26:39,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:26:39,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:26:39,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:26:39,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:26:39,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:26:39,779 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:26:39,779 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:26:39,790 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:26:39,802 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 07:26:39,802 INFO L444 ModelExtractionUtils]: 31 out of 37 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 07:26:39,802 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:26:39,803 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:26:39,803 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:26:39,803 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, ULTIMATE.start_sep_~i~0) = 1*~N~0 - 1*ULTIMATE.start_sep_~i~0 Supporting invariants [] [2018-11-10 07:26:39,826 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2018-11-10 07:26:39,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:26:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:26:39,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:26:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:26:39,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:26:39,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:26:39,899 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 07:26:39,899 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 244 states and 271 transitions. cyclomatic complexity: 38 Second operand 4 states. [2018-11-10 07:26:39,913 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 244 states and 271 transitions. cyclomatic complexity: 38. Second operand 4 states. Result 252 states and 282 transitions. Complement of second has 6 states. [2018-11-10 07:26:39,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:26:39,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 07:26:39,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2018-11-10 07:26:39,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 50 letters. Loop has 5 letters. [2018-11-10 07:26:39,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:26:39,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 55 letters. Loop has 5 letters. [2018-11-10 07:26:39,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:26:39,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 50 letters. Loop has 10 letters. [2018-11-10 07:26:39,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:26:39,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 252 states and 282 transitions. [2018-11-10 07:26:39,917 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:26:39,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 252 states to 0 states and 0 transitions. [2018-11-10 07:26:39,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 07:26:39,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 07:26:39,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 07:26:39,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:26:39,918 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:26:39,918 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:26:39,918 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:26:39,918 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 07:26:39,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:26:39,918 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:26:39,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 07:26:39,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 07:26:39 BoogieIcfgContainer [2018-11-10 07:26:39,927 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 07:26:39,927 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:26:39,927 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:26:39,927 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:26:39,927 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:26:12" (3/4) ... [2018-11-10 07:26:39,931 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 07:26:39,931 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:26:39,932 INFO L168 Benchmark]: Toolchain (without parser) took 27699.16 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 491.3 MB). Free memory was 959.1 MB in the beginning and 1.4 GB in the end (delta: -395.9 MB). Peak memory consumption was 95.3 MB. Max. memory is 11.5 GB. [2018-11-10 07:26:39,932 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:26:39,933 INFO L168 Benchmark]: CACSL2BoogieTranslator took 180.86 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:26:39,933 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.55 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:26:39,933 INFO L168 Benchmark]: Boogie Preprocessor took 20.57 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:26:39,934 INFO L168 Benchmark]: RCFGBuilder took 273.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -190.3 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-11-10 07:26:39,934 INFO L168 Benchmark]: BuchiAutomizer took 27185.82 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 331.4 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -221.8 MB). Peak memory consumption was 109.6 MB. Max. memory is 11.5 GB. [2018-11-10 07:26:39,935 INFO L168 Benchmark]: Witness Printer took 4.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:26:39,942 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 180.86 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.55 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.57 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 273.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -190.3 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 27185.82 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 331.4 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -221.8 MB). Peak memory consumption was 109.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 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 13 terminating modules (9 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. 9 modules have a trivial ranking function, the largest among these consists of 33 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 27.1s and 14 iterations. TraceHistogramMax:3. Analysis of lassos took 9.2s. Construction of modules took 2.0s. Büchi inclusion checks took 15.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 12. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 357 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 244 states and ocurred in iteration 12. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 520 SDtfs, 1276 SDslu, 2442 SDs, 0 SdLazy, 3729 SolverSat, 457 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU7 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital204 mio100 ax100 hnf99 lsp90 ukn87 mio100 lsp52 div100 bol100 ite100 ukn100 eq173 hnf86 smp88 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 4 VariablesLoop: 2 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...