./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/reducercommutativity/sep_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/reducercommutativity/sep_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.24-2e94e6a [2019-01-02 00:18:05,157 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:18:05,159 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:18:05,176 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:18:05,177 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:18:05,178 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:18:05,180 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:18:05,183 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:18:05,185 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:18:05,186 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:18:05,194 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:18:05,194 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:18:05,195 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:18:05,196 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:18:05,200 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:18:05,201 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:18:05,203 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:18:05,207 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:18:05,211 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:18:05,212 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:18:05,214 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:18:05,215 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:18:05,220 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:18:05,220 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:18:05,220 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:18:05,221 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:18:05,222 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:18:05,223 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:18:05,223 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:18:05,224 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:18:05,224 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:18:05,230 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:18:05,231 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:18:05,231 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:18:05,232 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:18:05,232 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:18:05,233 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-02 00:18:05,260 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:18:05,260 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:18:05,261 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:18:05,261 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:18:05,261 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:18:05,262 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:18:05,263 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:18:05,263 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:18:05,263 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:18:05,263 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:18:05,264 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:18:05,264 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:18:05,264 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:18:05,264 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:18:05,265 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:18:05,265 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:18:05,265 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:18:05,265 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:18:05,265 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:18:05,265 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:18:05,265 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:18:05,267 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:18:05,267 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:18:05,267 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:18:05,267 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:18:05,268 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:18:05,268 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:18:05,268 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:18:05,268 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:18:05,268 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:18:05,268 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:18:05,269 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:18:05,270 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2019-01-02 00:18:05,326 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:18:05,343 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:18:05,348 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:18:05,349 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:18:05,350 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:18:05,351 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/reducercommutativity/sep_true-unreach-call_true-termination.i [2019-01-02 00:18:05,416 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edad45593/957ee7e876cf44d9bc054c14747fd232/FLAGb9806a53b [2019-01-02 00:18:05,831 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:18:05,832 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/reducercommutativity/sep_true-unreach-call_true-termination.i [2019-01-02 00:18:05,838 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edad45593/957ee7e876cf44d9bc054c14747fd232/FLAGb9806a53b [2019-01-02 00:18:06,216 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edad45593/957ee7e876cf44d9bc054c14747fd232 [2019-01-02 00:18:06,220 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:18:06,221 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:18:06,222 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:18:06,223 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:18:06,226 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:18:06,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:18:06" (1/1) ... [2019-01-02 00:18:06,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@283bee70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:06, skipping insertion in model container [2019-01-02 00:18:06,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:18:06" (1/1) ... [2019-01-02 00:18:06,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:18:06,259 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:18:06,514 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:18:06,526 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:18:06,551 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:18:06,566 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:18:06,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:06 WrapperNode [2019-01-02 00:18:06,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:18:06,568 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:18:06,568 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:18:06,568 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:18:06,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:06" (1/1) ... [2019-01-02 00:18:06,584 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:06" (1/1) ... [2019-01-02 00:18:06,612 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:18:06,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:18:06,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:18:06,613 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:18:06,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:06" (1/1) ... [2019-01-02 00:18:06,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:06" (1/1) ... [2019-01-02 00:18:06,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:06" (1/1) ... [2019-01-02 00:18:06,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:06" (1/1) ... [2019-01-02 00:18:06,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:06" (1/1) ... [2019-01-02 00:18:06,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:06" (1/1) ... [2019-01-02 00:18:06,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:06" (1/1) ... [2019-01-02 00:18:06,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:18:06,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:18:06,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:18:06,710 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:18:06,715 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:18:06,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-02 00:18:06,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:18:06,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:18:06,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-02 00:18:06,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-02 00:18:06,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-02 00:18:07,332 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:18:07,332 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2019-01-02 00:18:07,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:18:07 BoogieIcfgContainer [2019-01-02 00:18:07,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:18:07,333 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:18:07,334 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:18:07,339 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:18:07,340 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:18:07,340 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:18:06" (1/3) ... [2019-01-02 00:18:07,341 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ba18add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:18:07, skipping insertion in model container [2019-01-02 00:18:07,342 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:18:07,342 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:18:06" (2/3) ... [2019-01-02 00:18:07,342 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ba18add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:18:07, skipping insertion in model container [2019-01-02 00:18:07,342 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:18:07,344 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:18:07" (3/3) ... [2019-01-02 00:18:07,346 INFO L375 chiAutomizerObserver]: Analyzing ICFG sep_true-unreach-call_true-termination.i [2019-01-02 00:18:07,410 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:18:07,410 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:18:07,411 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:18:07,411 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:18:07,411 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:18:07,411 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:18:07,411 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:18:07,412 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:18:07,412 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:18:07,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-01-02 00:18:07,450 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:18:07,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:18:07,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:18:07,457 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-02 00:18:07,457 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:18:07,457 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:18:07,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-01-02 00:18:07,460 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:18:07,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:18:07,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:18:07,461 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-02 00:18:07,461 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:18:07,468 INFO L794 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 10#L-1true 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; 14#L23true assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;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; 6#L9-3true [2019-01-02 00:18:07,469 INFO L796 eck$LassoCheckResult]: Loop: 6#L9-3true assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 28#L11true assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 7#L9-2true sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 6#L9-3true [2019-01-02 00:18:07,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:07,475 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-01-02 00:18:07,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:07,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:07,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:07,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:07,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:07,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:07,604 INFO L82 PathProgramCache]: Analyzing trace with hash 42800, now seen corresponding path program 1 times [2019-01-02 00:18:07,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:07,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:07,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:07,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:07,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:07,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:07,641 INFO L82 PathProgramCache]: Analyzing trace with hash 889512687, now seen corresponding path program 1 times [2019-01-02 00:18:07,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:07,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:07,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:07,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:07,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:07,812 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-02 00:18:08,145 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2019-01-02 00:18:08,481 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-02 00:18:08,511 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:18:08,513 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:18:08,513 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:18:08,513 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:18:08,513 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:18:08,514 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:18:08,514 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:18:08,514 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:18:08,514 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep_true-unreach-call_true-termination.i_Iteration1_Lasso [2019-01-02 00:18:08,514 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:18:08,516 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:18:08,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:08,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:08,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:08,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:08,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:08,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:08,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:08,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:08,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:08,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:08,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:08,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:08,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:08,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:08,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:08,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:08,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:08,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:08,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:08,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:08,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:09,248 WARN L181 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-01-02 00:18:09,384 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-02 00:18:09,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:09,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:09,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:09,907 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:18:09,912 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:18:09,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:09,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:09,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:09,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:09,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:09,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:09,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:09,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:09,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:09,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:09,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:09,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:09,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:09,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:09,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:09,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:09,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:09,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:09,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:09,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:09,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:09,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:09,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:09,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:09,928 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:09,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:09,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:09,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:09,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:09,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:09,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:09,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:09,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:09,931 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:09,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:09,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:09,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:09,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:09,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:09,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:09,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:09,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:09,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:09,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:09,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:09,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 [2019-01-02 00:18:09,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:09,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:09,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:09,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:09,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:09,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:09,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:09,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:09,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:09,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:09,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:09,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:09,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:09,947 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:09,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:09,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:09,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:09,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:09,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:09,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:09,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:09,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:09,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:09,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:09,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:09,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:09,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:09,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:09,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:09,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:09,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:09,954 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:09,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:09,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:09,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:09,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:09,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:09,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:09,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:09,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:09,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:09,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:09,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:09,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:09,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:09,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:09,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:09,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:09,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:09,962 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:09,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:09,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:09,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:09,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:09,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:09,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:09,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:09,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:09,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:09,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:09,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:09,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:09,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:09,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:09,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:09,984 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:09,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:09,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:09,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:09,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:09,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:09,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:09,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:09,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:09,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:09,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:09,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:09,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:09,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:09,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:09,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:09,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:09,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:09,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:09,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:09,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:09,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:09,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:09,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:09,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:09,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:09,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:09,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:09,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:10,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:10,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:10,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:10,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:10,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:10,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:10,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:10,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:10,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:10,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:10,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:10,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:10,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:10,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:10,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:10,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:10,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:10,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:10,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:10,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:10,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:10,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:10,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:10,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:10,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:10,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:10,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:10,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:10,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:10,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:10,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:10,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:10,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:10,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:10,014 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:10,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:10,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:10,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:10,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:10,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:10,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:10,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:10,024 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:10,024 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:10,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:10,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:10,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:10,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:10,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:10,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:10,048 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:10,051 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:10,167 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:18:10,248 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-02 00:18:10,249 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-02 00:18:10,252 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:18:10,254 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:18:10,255 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:18:10,256 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sep_~x.offset, v_rep(select #length ULTIMATE.start_sep_~x.base)_1, ULTIMATE.start_sep_~i~0) = -1*ULTIMATE.start_sep_~x.offset + 1*v_rep(select #length ULTIMATE.start_sep_~x.base)_1 - 4*ULTIMATE.start_sep_~i~0 Supporting invariants [] [2019-01-02 00:18:10,321 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-02 00:18:10,328 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:18:10,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:10,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:10,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:10,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:10,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:18:10,463 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 [2019-01-02 00:18:10,464 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states. Second operand 3 states. [2019-01-02 00:18:10,542 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states.. Second operand 3 states. Result 57 states and 81 transitions. Complement of second has 8 states. [2019-01-02 00:18:10,546 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 [2019-01-02 00:18:10,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:18:10,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2019-01-02 00:18:10,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 3 letters. [2019-01-02 00:18:10,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:10,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-02 00:18:10,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:10,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 6 letters. [2019-01-02 00:18:10,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:10,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 81 transitions. [2019-01-02 00:18:10,567 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-01-02 00:18:10,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 20 states and 29 transitions. [2019-01-02 00:18:10,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-02 00:18:10,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-02 00:18:10,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2019-01-02 00:18:10,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:18:10,579 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-01-02 00:18:10,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2019-01-02 00:18:10,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-02 00:18:10,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-02 00:18:10,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-01-02 00:18:10,605 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-01-02 00:18:10,605 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-01-02 00:18:10,605 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:18:10,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2019-01-02 00:18:10,606 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-01-02 00:18:10,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:18:10,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:18:10,607 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-02 00:18:10,607 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:18:10,608 INFO L794 eck$LassoCheckResult]: Stem: 159#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 156#L-1 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; 157#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;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; 147#L9-3 assume !(sep_~i~0 < ~N~0); 144#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 145#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);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; 146#L9-8 [2019-01-02 00:18:10,608 INFO L796 eck$LassoCheckResult]: Loop: 146#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 154#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 155#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 146#L9-8 [2019-01-02 00:18:10,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:10,608 INFO L82 PathProgramCache]: Analyzing trace with hash 889511019, now seen corresponding path program 1 times [2019-01-02 00:18:10,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:10,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:10,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:10,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:10,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:10,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:18:10,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:18:10,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:18:10,693 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:18:10,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:10,694 INFO L82 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 1 times [2019-01-02 00:18:10,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:10,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:10,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:10,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:10,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:10,915 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2019-01-02 00:18:10,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:18:10,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:18:10,920 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-02 00:18:10,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:18:10,960 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2019-01-02 00:18:10,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:18:10,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2019-01-02 00:18:10,966 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-01-02 00:18:10,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 29 transitions. [2019-01-02 00:18:10,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-02 00:18:10,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-02 00:18:10,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2019-01-02 00:18:10,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:18:10,969 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-01-02 00:18:10,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2019-01-02 00:18:10,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-01-02 00:18:10,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-02 00:18:10,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2019-01-02 00:18:10,973 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-01-02 00:18:10,973 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-01-02 00:18:10,973 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:18:10,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2019-01-02 00:18:10,975 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-01-02 00:18:10,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:18:10,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:18:10,976 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:18:10,976 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:18:10,977 INFO L794 eck$LassoCheckResult]: Stem: 207#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 204#L-1 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; 205#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;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; 195#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 196#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 200#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 197#L9-3 assume !(sep_~i~0 < ~N~0); 192#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 193#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);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; 194#L9-8 [2019-01-02 00:18:10,978 INFO L796 eck$LassoCheckResult]: Loop: 194#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 202#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 203#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 194#L9-8 [2019-01-02 00:18:10,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:10,978 INFO L82 PathProgramCache]: Analyzing trace with hash -473899520, now seen corresponding path program 1 times [2019-01-02 00:18:10,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:10,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:10,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:10,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:10,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:11,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:18:11,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:18:11,067 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:18:11,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:11,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:11,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:18:11,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:18:11,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-01-02 00:18:11,231 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:18:11,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:11,232 INFO L82 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 2 times [2019-01-02 00:18:11,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:11,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:11,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:11,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:11,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:11,437 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-02 00:18:11,556 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2019-01-02 00:18:11,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-02 00:18:11,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-02 00:18:11,558 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 10 Second operand 6 states. [2019-01-02 00:18:11,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:18:11,638 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-01-02 00:18:11,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:18:11,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2019-01-02 00:18:11,641 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-01-02 00:18:11,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 33 transitions. [2019-01-02 00:18:11,643 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-02 00:18:11,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-02 00:18:11,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2019-01-02 00:18:11,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:18:11,644 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-01-02 00:18:11,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2019-01-02 00:18:11,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-01-02 00:18:11,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-02 00:18:11,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2019-01-02 00:18:11,647 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-01-02 00:18:11,647 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-01-02 00:18:11,647 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-02 00:18:11,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2019-01-02 00:18:11,648 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-01-02 00:18:11,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:18:11,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:18:11,650 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-02 00:18:11,650 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:18:11,650 INFO L794 eck$LassoCheckResult]: Stem: 288#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 284#L-1 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; 285#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;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; 273#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 274#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 279#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 275#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 276#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 289#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 290#L9-3 assume !(sep_~i~0 < ~N~0); 270#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 271#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);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; 272#L9-8 [2019-01-02 00:18:11,650 INFO L796 eck$LassoCheckResult]: Loop: 272#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 281#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 282#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 272#L9-8 [2019-01-02 00:18:11,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:11,651 INFO L82 PathProgramCache]: Analyzing trace with hash -331548597, now seen corresponding path program 2 times [2019-01-02 00:18:11,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:11,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:11,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:11,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:18:11,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:11,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:11,704 INFO L82 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 3 times [2019-01-02 00:18:11,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:11,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:11,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:11,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:18:11,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:11,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:11,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1260561435, now seen corresponding path program 1 times [2019-01-02 00:18:11,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:11,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:11,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:11,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:18:11,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:12,049 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 29 [2019-01-02 00:18:12,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:18:12,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:18:12,296 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:18:12,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:12,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:12,762 INFO L478 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 29 treesize of output 22 [2019-01-02 00:18:12,767 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2019-01-02 00:18:12,783 INFO L478 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 24 treesize of output 21 [2019-01-02 00:18:12,784 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-02 00:18:12,792 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:18:12,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:18:12,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:18:12,813 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2019-01-02 00:18:12,871 INFO L478 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 [2019-01-02 00:18:12,889 INFO L478 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 [2019-01-02 00:18:12,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-02 00:18:12,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:18:12,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:18:12,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:6 [2019-01-02 00:18:13,090 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:18:13,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:18:13,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-01-02 00:18:13,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-02 00:18:13,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-01-02 00:18:13,181 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 11 Second operand 15 states. [2019-01-02 00:18:13,664 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2019-01-02 00:18:15,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:18:15,158 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2019-01-02 00:18:15,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-02 00:18:15,160 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 101 transitions. [2019-01-02 00:18:15,163 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 18 [2019-01-02 00:18:15,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 101 transitions. [2019-01-02 00:18:15,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2019-01-02 00:18:15,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2019-01-02 00:18:15,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 101 transitions. [2019-01-02 00:18:15,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:18:15,167 INFO L705 BuchiCegarLoop]: Abstraction has 76 states and 101 transitions. [2019-01-02 00:18:15,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 101 transitions. [2019-01-02 00:18:15,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 31. [2019-01-02 00:18:15,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-02 00:18:15,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-01-02 00:18:15,174 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-01-02 00:18:15,175 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-01-02 00:18:15,175 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-02 00:18:15,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2019-01-02 00:18:15,177 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-01-02 00:18:15,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:18:15,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:18:15,177 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:18:15,178 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:18:15,178 INFO L794 eck$LassoCheckResult]: Stem: 466#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 462#L-1 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; 463#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;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; 451#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 452#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 458#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 453#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 454#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 468#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 470#L9-3 assume !(sep_~i~0 < ~N~0); 471#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 449#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);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; 450#L9-8 [2019-01-02 00:18:15,178 INFO L796 eck$LassoCheckResult]: Loop: 450#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 469#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 460#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 450#L9-8 [2019-01-02 00:18:15,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:15,178 INFO L82 PathProgramCache]: Analyzing trace with hash -333395639, now seen corresponding path program 1 times [2019-01-02 00:18:15,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:15,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:15,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:15,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:15,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:15,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:15,227 INFO L82 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 4 times [2019-01-02 00:18:15,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:15,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:15,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:15,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:15,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:15,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:15,237 INFO L82 PathProgramCache]: Analyzing trace with hash 2069908061, now seen corresponding path program 1 times [2019-01-02 00:18:15,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:15,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:15,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:15,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:18:15,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:15,504 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-02 00:18:16,002 WARN L181 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 127 [2019-01-02 00:18:16,443 WARN L181 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-01-02 00:18:16,446 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:18:16,446 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:18:16,446 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:18:16,447 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:18:16,447 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:18:16,447 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:18:16,447 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:18:16,447 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:18:16,448 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep_true-unreach-call_true-termination.i_Iteration5_Lasso [2019-01-02 00:18:16,448 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:18:16,448 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:18:16,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:16,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:16,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:16,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18: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 [2019-01-02 00:18:16,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:16,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18: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 [2019-01-02 00:18:16,653 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-01-02 00:18:16,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:16,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:16,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:16,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:16,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:16,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:16,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:16,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:16,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:16,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:16,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:16,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:16,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:16,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:16,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:17,348 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:18:17,348 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:18:17,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:17,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:17,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:17,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:17,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:17,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:17,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:17,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:17,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:17,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:17,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:17,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:17,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:17,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:17,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:17,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:17,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:17,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:17,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:17,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:17,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:17,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:17,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:17,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:17,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:17,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:17,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:17,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:17,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:17,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:17,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:17,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:17,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:17,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:17,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:17,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:17,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:17,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:17,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:17,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:17,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:17,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:17,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:17,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:17,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:17,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:17,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:17,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:17,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:17,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:17,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:17,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:17,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:17,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:17,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:17,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:17,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:17,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:17,410 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:17,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:17,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:17,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:17,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:17,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:17,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:17,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:17,420 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:17,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:17,465 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:18:17,500 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-02 00:18:17,500 INFO L444 ModelExtractionUtils]: 16 out of 25 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-01-02 00:18:17,501 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:18:17,503 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:18:17,504 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:18:17,504 INFO L520 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 [] [2019-01-02 00:18:17,610 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-02 00:18:17,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:17,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:17,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:17,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:18:17,913 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 [2019-01-02 00:18:17,913 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 42 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-01-02 00:18:17,944 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 42 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 40 states and 58 transitions. Complement of second has 7 states. [2019-01-02 00:18:17,945 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 [2019-01-02 00:18:17,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:18:17,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2019-01-02 00:18:17,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 12 letters. Loop has 3 letters. [2019-01-02 00:18:17,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:17,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-02 00:18:17,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:17,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 12 letters. Loop has 6 letters. [2019-01-02 00:18:17,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:17,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 58 transitions. [2019-01-02 00:18:17,949 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-02 00:18:17,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 32 states and 44 transitions. [2019-01-02 00:18:17,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-02 00:18:17,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-02 00:18:17,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 44 transitions. [2019-01-02 00:18:17,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:18:17,952 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2019-01-02 00:18:17,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 44 transitions. [2019-01-02 00:18:17,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-02 00:18:17,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-02 00:18:17,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2019-01-02 00:18:17,956 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2019-01-02 00:18:17,956 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2019-01-02 00:18:17,956 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-02 00:18:17,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 44 transitions. [2019-01-02 00:18:17,957 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-02 00:18:17,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:18:17,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:18:17,960 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:18:17,960 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:18:17,961 INFO L794 eck$LassoCheckResult]: Stem: 622#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 618#L-1 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; 619#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;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; 607#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 608#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 614#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 609#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 610#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 629#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 627#L9-3 assume !(sep_~i~0 < ~N~0); 626#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 605#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);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; 606#L9-8 assume !(sep_~i~0 < ~N~0); 620#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 601#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 602#L35-3 [2019-01-02 00:18:17,961 INFO L796 eck$LassoCheckResult]: Loop: 602#L35-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 621#L35-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 602#L35-3 [2019-01-02 00:18:17,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:17,961 INFO L82 PathProgramCache]: Analyzing trace with hash 2069906393, now seen corresponding path program 1 times [2019-01-02 00:18:17,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:17,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:17,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:17,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:17,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:18,014 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-02 00:18:18,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:18:18,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-02 00:18:18,015 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:18:18,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:18,015 INFO L82 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 1 times [2019-01-02 00:18:18,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:18,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:18,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:18,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:18,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:18,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:18,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:18:18,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:18:18,135 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. cyclomatic complexity: 17 Second operand 4 states. [2019-01-02 00:18:18,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:18:18,176 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2019-01-02 00:18:18,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:18:18,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 49 transitions. [2019-01-02 00:18:18,180 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-02 00:18:18,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 49 transitions. [2019-01-02 00:18:18,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-01-02 00:18:18,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-01-02 00:18:18,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 49 transitions. [2019-01-02 00:18:18,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:18:18,181 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 49 transitions. [2019-01-02 00:18:18,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 49 transitions. [2019-01-02 00:18:18,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2019-01-02 00:18:18,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-02 00:18:18,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2019-01-02 00:18:18,187 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-01-02 00:18:18,187 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-01-02 00:18:18,187 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-02 00:18:18,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2019-01-02 00:18:18,188 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-02 00:18:18,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:18:18,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:18:18,189 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:18:18,189 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:18:18,189 INFO L794 eck$LassoCheckResult]: Stem: 695#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 692#L-1 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; 693#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;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; 682#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 683#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 688#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 684#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 685#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 707#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 700#L9-3 assume !(sep_~i~0 < ~N~0); 701#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 706#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);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; 705#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 699#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 691#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 698#L9-8 assume !(sep_~i~0 < ~N~0); 696#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 677#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 678#L35-3 [2019-01-02 00:18:18,190 INFO L796 eck$LassoCheckResult]: Loop: 678#L35-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 697#L35-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 678#L35-3 [2019-01-02 00:18:18,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:18,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1787455815, now seen corresponding path program 1 times [2019-01-02 00:18:18,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:18,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:18,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:18,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:18,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:18,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-02 00:18:18,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:18:18,488 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:18:18,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:18,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:18,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-02 00:18:18,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:18:18,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-01-02 00:18:18,613 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:18:18,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:18,613 INFO L82 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 2 times [2019-01-02 00:18:18,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:18,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:18,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:18,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:18,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:18,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-02 00:18:18,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-02 00:18:18,697 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. cyclomatic complexity: 15 Second operand 7 states. [2019-01-02 00:18:18,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:18:18,771 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2019-01-02 00:18:18,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-02 00:18:18,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 59 transitions. [2019-01-02 00:18:18,773 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-02 00:18:18,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 59 transitions. [2019-01-02 00:18:18,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-02 00:18:18,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-02 00:18:18,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 59 transitions. [2019-01-02 00:18:18,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:18:18,776 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 59 transitions. [2019-01-02 00:18:18,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 59 transitions. [2019-01-02 00:18:18,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2019-01-02 00:18:18,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-02 00:18:18,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2019-01-02 00:18:18,780 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2019-01-02 00:18:18,780 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2019-01-02 00:18:18,780 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-02 00:18:18,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 46 transitions. [2019-01-02 00:18:18,783 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-02 00:18:18,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:18:18,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:18:18,784 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:18:18,784 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:18:18,785 INFO L794 eck$LassoCheckResult]: Stem: 836#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 833#L-1 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; 834#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;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; 822#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 823#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 847#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 824#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 825#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 840#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 851#L9-3 assume !(sep_~i~0 < ~N~0); 850#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 849#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);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; 848#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 846#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 843#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 842#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 831#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 832#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 844#L9-8 assume !(sep_~i~0 < ~N~0); 837#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 817#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 818#L35-3 [2019-01-02 00:18:18,785 INFO L796 eck$LassoCheckResult]: Loop: 818#L35-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 838#L35-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 818#L35-3 [2019-01-02 00:18:18,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:18,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1143219481, now seen corresponding path program 2 times [2019-01-02 00:18:18,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:18,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:18,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:18,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:18:18,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:19,492 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-02 00:18:19,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:18:19,492 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:18:19,503 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-02 00:18:19,526 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-02 00:18:19,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:18:19,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:19,617 INFO L478 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 28 treesize of output 21 [2019-01-02 00:18:19,620 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-02 00:18:19,627 INFO L478 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 23 treesize of output 20 [2019-01-02 00:18:19,629 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-02 00:18:19,635 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:18:19,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:18:19,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:18:19,652 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:16 [2019-01-02 00:18:19,702 INFO L478 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 [2019-01-02 00:18:19,713 INFO L478 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 [2019-01-02 00:18:19,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-02 00:18:19,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:18:19,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:18:19,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-01-02 00:18:19,756 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-02 00:18:19,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:18:19,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-01-02 00:18:19,775 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:18:19,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:19,776 INFO L82 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 3 times [2019-01-02 00:18:19,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:19,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:19,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:19,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:18:19,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:19,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-02 00:18:19,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-01-02 00:18:19,845 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. cyclomatic complexity: 16 Second operand 15 states. [2019-01-02 00:18:20,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:18:20,728 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2019-01-02 00:18:20,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-02 00:18:20,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 76 transitions. [2019-01-02 00:18:20,731 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-01-02 00:18:20,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 76 transitions. [2019-01-02 00:18:20,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-01-02 00:18:20,733 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2019-01-02 00:18:20,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 76 transitions. [2019-01-02 00:18:20,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:18:20,733 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 76 transitions. [2019-01-02 00:18:20,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 76 transitions. [2019-01-02 00:18:20,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 35. [2019-01-02 00:18:20,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-02 00:18:20,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2019-01-02 00:18:20,738 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-01-02 00:18:20,739 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-01-02 00:18:20,739 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-02 00:18:20,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2019-01-02 00:18:20,739 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-02 00:18:20,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:18:20,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:18:20,740 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:18:20,740 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:18:20,740 INFO L794 eck$LassoCheckResult]: Stem: 1022#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1019#L-1 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; 1020#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;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; 1009#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1010#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1015#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1011#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1012#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1037#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1031#L9-3 assume !(sep_~i~0 < ~N~0); 1032#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1007#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);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; 1008#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1036#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1035#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1029#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1017#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1018#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1030#L9-8 assume !(sep_~i~0 < ~N~0); 1023#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1003#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1004#L35-3 [2019-01-02 00:18:20,740 INFO L796 eck$LassoCheckResult]: Loop: 1004#L35-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1024#L35-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1004#L35-3 [2019-01-02 00:18:20,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:20,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1952566107, now seen corresponding path program 1 times [2019-01-02 00:18:20,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:20,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:20,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:20,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:18:20,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:20,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:20,786 INFO L82 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 4 times [2019-01-02 00:18:20,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:20,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:20,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:20,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:20,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:20,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:20,795 INFO L82 PathProgramCache]: Analyzing trace with hash -484677763, now seen corresponding path program 1 times [2019-01-02 00:18:20,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:20,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:20,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:20,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:18:20,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:21,218 WARN L181 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-02 00:18:21,909 WARN L181 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 167 [2019-01-02 00:18:22,511 WARN L181 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 79 [2019-01-02 00:18:22,514 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:18:22,514 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:18:22,514 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:18:22,514 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:18:22,514 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:18:22,514 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:18:22,514 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:18:22,514 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:18:22,515 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep_true-unreach-call_true-termination.i_Iteration9_Lasso [2019-01-02 00:18:22,515 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:18:22,515 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:18:22,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:22,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:22,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:22,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:22,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:22,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:22,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:22,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:22,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:22,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:22,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:22,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:22,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:23,108 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-01-02 00:18:23,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:23,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:23,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:23,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:23,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:23,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:23,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:23,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:23,775 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-02 00:18:23,841 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:18:23,842 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:18:23,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:23,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:23,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:23,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:23,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:23,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:23,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:23,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:23,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:23,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:23,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:23,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:23,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:23,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:23,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:23,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:23,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:23,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:23,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:23,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:23,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:23,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:23,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:23,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:23,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:23,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:23,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:23,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:23,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:23,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:23,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:23,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:23,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:23,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:23,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:23,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:23,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:23,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:23,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:23,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:23,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:23,858 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:23,858 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:23,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:23,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:23,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:23,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:23,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:23,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:23,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:23,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:23,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:23,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:23,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:23,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:23,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:23,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:23,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:23,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:23,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:23,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:23,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:23,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:23,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:23,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:23,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:23,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:23,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:23,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:23,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:23,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:23,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:23,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:23,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:23,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:23,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:23,883 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:23,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:23,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:23,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:23,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:23,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:23,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:23,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:23,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:23,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:23,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:23,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:23,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 [2019-01-02 00:18:23,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:23,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:23,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:23,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:23,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:23,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:23,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:23,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:23,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 [2019-01-02 00:18:23,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:23,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:23,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:23,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:23,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:23,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:23,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:23,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:23,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:23,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:23,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:23,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:23,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:23,912 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:23,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:23,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:23,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:23,918 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-02 00:18:23,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:23,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:23,923 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-02 00:18:23,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:23,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:23,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:23,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:23,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:23,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:23,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:23,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:23,938 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:23,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:23,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:23,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:23,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:23,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:23,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:23,956 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:23,956 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:23,969 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:18:24,001 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-02 00:18:24,003 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-02 00:18:24,004 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:18:24,004 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:18:24,004 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:18:24,007 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ~N~0) = -1*ULTIMATE.start_main_~i~1 + 1*~N~0 Supporting invariants [] [2019-01-02 00:18:24,237 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-01-02 00:18:24,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:24,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:24,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:24,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:18:24,724 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 [2019-01-02 00:18:24,724 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 15 Second operand 3 states. [2019-01-02 00:18:24,908 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 15. Second operand 3 states. Result 41 states and 56 transitions. Complement of second has 6 states. [2019-01-02 00:18:24,910 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 [2019-01-02 00:18:24,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:18:24,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2019-01-02 00:18:24,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 21 letters. Loop has 2 letters. [2019-01-02 00:18:24,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:24,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 23 letters. Loop has 2 letters. [2019-01-02 00:18:24,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:24,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 21 letters. Loop has 4 letters. [2019-01-02 00:18:24,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:24,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 56 transitions. [2019-01-02 00:18:24,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:18:24,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 36 states and 47 transitions. [2019-01-02 00:18:24,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-02 00:18:24,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-02 00:18:24,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 47 transitions. [2019-01-02 00:18:24,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:18:24,919 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2019-01-02 00:18:24,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 47 transitions. [2019-01-02 00:18:24,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-02 00:18:24,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-02 00:18:24,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2019-01-02 00:18:24,927 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2019-01-02 00:18:24,927 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2019-01-02 00:18:24,927 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-02 00:18:24,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 47 transitions. [2019-01-02 00:18:24,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:18:24,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:18:24,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:18:24,934 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:18:24,934 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:18:24,934 INFO L794 eck$LassoCheckResult]: Stem: 1225#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1222#L-1 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; 1223#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;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; 1212#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1213#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1218#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1214#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1215#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1242#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1239#L9-3 assume !(sep_~i~0 < ~N~0); 1236#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1235#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);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; 1229#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1230#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1221#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1231#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1232#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1233#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1234#L9-8 assume !(sep_~i~0 < ~N~0); 1226#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1207#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1208#L35-3 assume !(main_~i~1 < ~N~0 - 1); 1224#L35-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);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; 1216#L9-13 [2019-01-02 00:18:24,935 INFO L796 eck$LassoCheckResult]: Loop: 1216#L9-13 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1217#L11-4 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1219#L9-12 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1216#L9-13 [2019-01-02 00:18:24,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:24,935 INFO L82 PathProgramCache]: Analyzing trace with hash -484677821, now seen corresponding path program 1 times [2019-01-02 00:18:24,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:24,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:24,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:24,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:24,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:25,084 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-02 00:18:25,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:18:25,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-02 00:18:25,085 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:18:25,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:25,085 INFO L82 PathProgramCache]: Analyzing trace with hash 98408, now seen corresponding path program 1 times [2019-01-02 00:18:25,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:25,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:25,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:25,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:25,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:25,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:18:25,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:18:25,237 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. cyclomatic complexity: 16 Second operand 4 states. [2019-01-02 00:18:25,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:18:25,263 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2019-01-02 00:18:25,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:18:25,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2019-01-02 00:18:25,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:18:25,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 47 transitions. [2019-01-02 00:18:25,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-02 00:18:25,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-02 00:18:25,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 47 transitions. [2019-01-02 00:18:25,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:18:25,268 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2019-01-02 00:18:25,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 47 transitions. [2019-01-02 00:18:25,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-01-02 00:18:25,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-02 00:18:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2019-01-02 00:18:25,273 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2019-01-02 00:18:25,274 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2019-01-02 00:18:25,274 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-02 00:18:25,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 46 transitions. [2019-01-02 00:18:25,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:18:25,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:18:25,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:18:25,279 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:18:25,279 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:18:25,279 INFO L794 eck$LassoCheckResult]: Stem: 1307#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1303#L-1 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; 1304#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;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; 1292#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1293#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1322#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1321#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1320#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1319#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1317#L9-3 assume !(sep_~i~0 < ~N~0); 1316#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1315#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);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; 1314#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1313#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1312#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1310#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1300#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1301#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1311#L9-8 assume !(sep_~i~0 < ~N~0); 1308#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1287#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1288#L35-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1305#L35-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1306#L35-3 assume !(main_~i~1 < ~N~0 - 1); 1302#L35-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);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; 1296#L9-13 [2019-01-02 00:18:25,280 INFO L796 eck$LassoCheckResult]: Loop: 1296#L9-13 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1297#L11-4 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1298#L9-12 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1296#L9-13 [2019-01-02 00:18:25,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:25,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1918860571, now seen corresponding path program 1 times [2019-01-02 00:18:25,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:25,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:25,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:25,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:25,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:25,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:25,336 INFO L82 PathProgramCache]: Analyzing trace with hash 98408, now seen corresponding path program 2 times [2019-01-02 00:18:25,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:25,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:25,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:25,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:25,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:25,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:25,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1239507716, now seen corresponding path program 1 times [2019-01-02 00:18:25,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:25,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:25,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:25,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:18:25,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:25,791 WARN L181 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 8 [2019-01-02 00:18:26,871 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:18:26,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:18:26,871 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:18:26,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:26,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:27,694 INFO L478 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 [2019-01-02 00:18:27,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-02 00:18:27,702 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2019-01-02 00:18:27,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-02 00:18:27,733 INFO L478 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 20 treesize of output 23 [2019-01-02 00:18:27,733 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-02 00:18:27,739 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:18:27,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:18:27,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:18:27,747 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:43, output treesize:19 [2019-01-02 00:18:27,813 INFO L478 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 [2019-01-02 00:18:27,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-02 00:18:27,817 INFO L478 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 [2019-01-02 00:18:27,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-02 00:18:27,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:18:27,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:18:27,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-01-02 00:18:27,866 INFO L478 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 [2019-01-02 00:18:27,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-02 00:18:27,885 INFO L478 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 28 treesize of output 48 [2019-01-02 00:18:27,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-02 00:18:27,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-02 00:18:27,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-02 00:18:27,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:46 [2019-01-02 00:18:28,007 INFO L478 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 [2019-01-02 00:18:28,009 INFO L478 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 [2019-01-02 00:18:28,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-02 00:18:28,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:18:28,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:18:28,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:6 [2019-01-02 00:18:28,032 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-02 00:18:28,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:18:28,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10] total 26 [2019-01-02 00:18:28,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-02 00:18:28,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2019-01-02 00:18:28,122 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. cyclomatic complexity: 15 Second operand 26 states. [2019-01-02 00:18:45,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:18:45,103 INFO L93 Difference]: Finished difference Result 188 states and 232 transitions. [2019-01-02 00:18:45,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-02 00:18:45,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 232 transitions. [2019-01-02 00:18:45,107 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-01-02 00:18:45,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 188 states and 232 transitions. [2019-01-02 00:18:45,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2019-01-02 00:18:45,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2019-01-02 00:18:45,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 188 states and 232 transitions. [2019-01-02 00:18:45,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:18:45,111 INFO L705 BuchiCegarLoop]: Abstraction has 188 states and 232 transitions. [2019-01-02 00:18:45,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states and 232 transitions. [2019-01-02 00:18:45,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 118. [2019-01-02 00:18:45,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-02 00:18:45,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 149 transitions. [2019-01-02 00:18:45,122 INFO L728 BuchiCegarLoop]: Abstraction has 118 states and 149 transitions. [2019-01-02 00:18:45,122 INFO L608 BuchiCegarLoop]: Abstraction has 118 states and 149 transitions. [2019-01-02 00:18:45,123 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-02 00:18:45,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 149 transitions. [2019-01-02 00:18:45,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:18:45,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:18:45,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:18:45,128 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:18:45,128 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:18:45,128 INFO L794 eck$LassoCheckResult]: Stem: 1758#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1752#L-1 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; 1753#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;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; 1739#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1740#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1759#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1741#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1742#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1769#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1834#L9-3 assume !(sep_~i~0 < ~N~0); 1835#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1843#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);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; 1841#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1839#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1838#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1836#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1813#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1814#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1812#L9-8 assume !(sep_~i~0 < ~N~0); 1811#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1810#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1774#L35-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1773#L35-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1772#L35-3 assume !(main_~i~1 < ~N~0 - 1); 1751#L35-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);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; 1743#L9-13 [2019-01-02 00:18:45,131 INFO L796 eck$LassoCheckResult]: Loop: 1743#L9-13 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1744#L11-4 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1746#L9-12 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1743#L9-13 [2019-01-02 00:18:45,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:45,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1273346529, now seen corresponding path program 1 times [2019-01-02 00:18:45,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:45,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:45,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:45,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:45,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:45,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:45,184 INFO L82 PathProgramCache]: Analyzing trace with hash 98408, now seen corresponding path program 3 times [2019-01-02 00:18:45,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:45,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:45,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:45,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:18:45,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:45,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:45,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1115355784, now seen corresponding path program 1 times [2019-01-02 00:18:45,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:18:45,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:18:45,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:45,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:18:45,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:18:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:18:45,366 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-02 00:18:46,806 WARN L181 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 253 DAG size of output: 198 [2019-01-02 00:18:47,344 WARN L181 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2019-01-02 00:18:47,348 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:18:47,348 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:18:47,348 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:18:47,348 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:18:47,348 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:18:47,348 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:18:47,348 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:18:47,348 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:18:47,349 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep_true-unreach-call_true-termination.i_Iteration12_Lasso [2019-01-02 00:18:47,349 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:18:47,349 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:18:47,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:47,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:47,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:47,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:47,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:47,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:47,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:47,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:47,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:47,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:47,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:47,537 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-01-02 00:18:47,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:47,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:47,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:47,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:47,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:47,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:47,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:47,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:47,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:47,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:47,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:18:48,063 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:18:48,063 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:18:48,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:48,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:48,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:48,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:48,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:48,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:48,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:48,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:48,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:48,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:48,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:48,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:48,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:48,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:48,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:48,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:48,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:48,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:48,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:48,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:48,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:48,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:48,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:48,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:48,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:48,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:48,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:48,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:48,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:48,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:48,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:48,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:48,075 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:48,075 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:48,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:48,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:48,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:48,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:48,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:48,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:48,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:48,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:48,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:48,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:48,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:48,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:48,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:48,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:48,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:48,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:48,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:48,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:48,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:48,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:48,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:48,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:48,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:48,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:48,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:48,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:48,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:48,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:48,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:48,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:48,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:48,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:48,103 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:48,117 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:48,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:48,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:48,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:48,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:48,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:48,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:48,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:48,122 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:48,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:48,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:48,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:48,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:18:48,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:48,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:48,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:48,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:18:48,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:18:48,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:48,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:48,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:48,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:48,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:48,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:48,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:48,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:48,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:48,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:48,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:48,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:48,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:48,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:48,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:48,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:48,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:18:48,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:18:48,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:18:48,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:18:48,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:18:48,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:18:48,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:18:48,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:18:48,165 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:18:48,183 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-02 00:18:48,183 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-02 00:18:48,183 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:18:48,184 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:18:48,184 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:18:48,184 INFO L520 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 [] [2019-01-02 00:18:48,269 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-02 00:18:48,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:18:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:48,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:18:48,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:18:48,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:18:48,352 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 [2019-01-02 00:18:48,352 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 149 transitions. cyclomatic complexity: 43 Second operand 3 states. [2019-01-02 00:18:48,364 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 149 transitions. cyclomatic complexity: 43. Second operand 3 states. Result 122 states and 156 transitions. Complement of second has 4 states. [2019-01-02 00:18:48,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-02 00:18:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:18:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2019-01-02 00:18:48,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 25 letters. Loop has 3 letters. [2019-01-02 00:18:48,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:48,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 28 letters. Loop has 3 letters. [2019-01-02 00:18:48,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:48,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 25 letters. Loop has 6 letters. [2019-01-02 00:18:48,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:18:48,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 156 transitions. [2019-01-02 00:18:48,369 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:18:48,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 0 states and 0 transitions. [2019-01-02 00:18:48,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:18:48,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:18:48,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:18:48,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:18:48,369 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:18:48,369 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:18:48,370 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:18:48,370 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-02 00:18:48,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:18:48,370 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:18:48,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:18:48,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:18:48 BoogieIcfgContainer [2019-01-02 00:18:48,377 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:18:48,378 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:18:48,378 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:18:48,378 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:18:48,378 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:18:07" (3/4) ... [2019-01-02 00:18:48,382 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:18:48,382 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:18:48,383 INFO L168 Benchmark]: Toolchain (without parser) took 42162.99 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 363.9 MB). Free memory was 952.7 MB in the beginning and 996.8 MB in the end (delta: -44.1 MB). Peak memory consumption was 319.8 MB. Max. memory is 11.5 GB. [2019-01-02 00:18:48,384 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:18:48,384 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.65 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-02 00:18:48,385 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.11 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:18:48,386 INFO L168 Benchmark]: Boogie Preprocessor took 96.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -198.5 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2019-01-02 00:18:48,386 INFO L168 Benchmark]: RCFGBuilder took 622.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:18:48,387 INFO L168 Benchmark]: BuchiAutomizer took 41043.79 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 218.6 MB). Free memory was 1.1 GB in the beginning and 996.8 MB in the end (delta: 116.8 MB). Peak memory consumption was 335.4 MB. Max. memory is 11.5 GB. [2019-01-02 00:18:48,388 INFO L168 Benchmark]: Witness Printer took 4.63 ms. Allocated memory is still 1.4 GB. Free memory is still 996.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:18:48,392 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 344.65 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 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 45.11 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 96.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -198.5 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 622.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 41043.79 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 218.6 MB). Free memory was 1.1 GB in the beginning and 996.8 MB in the end (delta: 116.8 MB). Peak memory consumption was 335.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.63 ms. Allocated memory is still 1.4 GB. Free memory is still 996.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (8 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x + unknown-#length-unknown[x] + -4 * i and consists of 5 locations. One deterministic module has affine ranking function 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 3 locations. 8 modules have a trivial ranking function, the largest among these consists of 26 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 40.9s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 19.2s. Construction of modules took 3.0s. Büchi inclusion checks took 18.3s. Highest rank in rank-based complementation 3. Minimization of det autom 12. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 159 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 118 states and ocurred in iteration 11. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 232 SDtfs, 498 SDslu, 602 SDs, 0 SdLazy, 1942 SolverSat, 379 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU6 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital187 mio100 ax100 hnf99 lsp89 ukn71 mio100 lsp58 div100 bol100 ite100 ukn100 eq168 hnf89 smp94 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms 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...