./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-examples/sanfoundry_24_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ceb1075b-a471-4cf6-b64c-7301130c02fc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ceb1075b-a471-4cf6-b64c-7301130c02fc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ceb1075b-a471-4cf6-b64c-7301130c02fc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ceb1075b-a471-4cf6-b64c-7301130c02fc/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-examples/sanfoundry_24_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ceb1075b-a471-4cf6-b64c-7301130c02fc/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ceb1075b-a471-4cf6-b64c-7301130c02fc/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 63b671e779f88a024ade70e8e63a2c2a737aca60 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 13:41:06,384 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:41:06,385 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:41:06,394 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:41:06,394 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:41:06,395 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:41:06,396 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:41:06,397 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:41:06,399 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:41:06,399 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:41:06,400 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:41:06,400 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:41:06,401 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:41:06,402 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:41:06,403 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:41:06,404 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:41:06,405 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:41:06,406 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:41:06,408 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:41:06,409 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:41:06,410 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:41:06,411 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:41:06,413 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:41:06,414 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:41:06,414 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:41:06,415 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:41:06,416 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:41:06,416 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:41:06,417 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:41:06,418 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:41:06,418 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:41:06,419 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:41:06,419 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:41:06,419 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:41:06,420 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:41:06,421 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:41:06,421 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ceb1075b-a471-4cf6-b64c-7301130c02fc/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 13:41:06,435 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:41:06,435 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:41:06,436 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:41:06,436 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:41:06,437 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:41:06,437 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 13:41:06,437 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 13:41:06,437 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 13:41:06,437 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 13:41:06,437 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 13:41:06,438 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 13:41:06,438 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:41:06,438 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:41:06,438 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 13:41:06,438 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:41:06,438 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:41:06,439 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:41:06,439 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 13:41:06,439 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 13:41:06,439 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 13:41:06,439 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:41:06,439 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:41:06,439 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 13:41:06,440 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:41:06,440 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 13:41:06,440 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:41:06,440 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:41:06,440 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 13:41:06,440 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:41:06,441 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:41:06,441 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 13:41:06,441 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 13:41:06,442 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_ceb1075b-a471-4cf6-b64c-7301130c02fc/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 63b671e779f88a024ade70e8e63a2c2a737aca60 [2018-11-23 13:41:06,467 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:41:06,477 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:41:06,479 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:41:06,480 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:41:06,480 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:41:06,480 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ceb1075b-a471-4cf6-b64c-7301130c02fc/bin-2019/uautomizer/../../sv-benchmarks/c/array-examples/sanfoundry_24_true-unreach-call_true-termination.i [2018-11-23 13:41:06,522 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ceb1075b-a471-4cf6-b64c-7301130c02fc/bin-2019/uautomizer/data/d91441656/ac76859ba3eb4d3489527bff5454376f/FLAG70a43c1a7 [2018-11-23 13:41:06,867 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:41:06,868 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ceb1075b-a471-4cf6-b64c-7301130c02fc/sv-benchmarks/c/array-examples/sanfoundry_24_true-unreach-call_true-termination.i [2018-11-23 13:41:06,872 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ceb1075b-a471-4cf6-b64c-7301130c02fc/bin-2019/uautomizer/data/d91441656/ac76859ba3eb4d3489527bff5454376f/FLAG70a43c1a7 [2018-11-23 13:41:07,295 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ceb1075b-a471-4cf6-b64c-7301130c02fc/bin-2019/uautomizer/data/d91441656/ac76859ba3eb4d3489527bff5454376f [2018-11-23 13:41:07,298 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:41:07,299 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:41:07,299 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:41:07,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:41:07,302 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:41:07,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:41:07" (1/1) ... [2018-11-23 13:41:07,304 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32768438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:41:07, skipping insertion in model container [2018-11-23 13:41:07,304 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:41:07" (1/1) ... [2018-11-23 13:41:07,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:41:07,323 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:41:07,433 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:41:07,435 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:41:07,448 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:41:07,462 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:41:07,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:41:07 WrapperNode [2018-11-23 13:41:07,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:41:07,463 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:41:07,463 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:41:07,463 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:41:07,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:41:07" (1/1) ... [2018-11-23 13:41:07,474 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:41:07" (1/1) ... [2018-11-23 13:41:07,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:41:07,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:41:07,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:41:07,488 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:41:07,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:41:07" (1/1) ... [2018-11-23 13:41:07,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:41:07" (1/1) ... [2018-11-23 13:41:07,495 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:41:07" (1/1) ... [2018-11-23 13:41:07,495 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:41:07" (1/1) ... [2018-11-23 13:41:07,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:41:07" (1/1) ... [2018-11-23 13:41:07,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:41:07" (1/1) ... [2018-11-23 13:41:07,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:41:07" (1/1) ... [2018-11-23 13:41:07,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:41:07,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:41:07,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:41:07,542 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:41:07,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:41:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ceb1075b-a471-4cf6-b64c-7301130c02fc/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:41:07,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:41:07,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:41:07,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:41:07,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:41:07,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:41:07,702 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:41:07,702 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-23 13:41:07,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:41:07 BoogieIcfgContainer [2018-11-23 13:41:07,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:41:07,703 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 13:41:07,703 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 13:41:07,705 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 13:41:07,706 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:41:07,706 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 01:41:07" (1/3) ... [2018-11-23 13:41:07,707 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13c2f3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:41:07, skipping insertion in model container [2018-11-23 13:41:07,707 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:41:07,707 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:41:07" (2/3) ... [2018-11-23 13:41:07,707 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13c2f3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:41:07, skipping insertion in model container [2018-11-23 13:41:07,707 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:41:07,707 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:41:07" (3/3) ... [2018-11-23 13:41:07,709 INFO L375 chiAutomizerObserver]: Analyzing ICFG sanfoundry_24_true-unreach-call_true-termination.i [2018-11-23 13:41:07,746 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:41:07,747 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 13:41:07,747 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 13:41:07,747 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 13:41:07,748 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:41:07,748 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:41:07,748 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 13:41:07,748 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:41:07,748 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 13:41:07,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-23 13:41:07,775 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-23 13:41:07,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:41:07,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:41:07,780 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 13:41:07,780 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 13:41:07,780 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 13:41:07,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-23 13:41:07,781 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-23 13:41:07,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:41:07,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:41:07,782 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 13:41:07,782 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 13:41:07,787 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem3, main_#t~post1, main_#t~mem5, main_#t~mem6, main_#t~post4, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~num~0;call main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc(400000);havoc main_~i~0;main_~num~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := 0; 15#L15-3true [2018-11-23 13:41:07,788 INFO L796 eck$LassoCheckResult]: Loop: 15#L15-3true assume !!(main_~i~0 < main_~num~0);call main_#t~mem2 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); 3#L17true assume !(0 == (if main_#t~mem2 < 0 && 0 != main_#t~mem2 % 2 then main_#t~mem2 % 2 - 2 else main_#t~mem2 % 2));havoc main_#t~mem2; 18#L15-2true main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 15#L15-3true [2018-11-23 13:41:07,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:41:07,794 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 13:41:07,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:41:07,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:41:07,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:07,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:41:07,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:41:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:41:07,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:41:07,865 INFO L82 PathProgramCache]: Analyzing trace with hash 40203, now seen corresponding path program 1 times [2018-11-23 13:41:07,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:41:07,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:41:07,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:07,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:41:07,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:41:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:41:07,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:41:07,893 INFO L82 PathProgramCache]: Analyzing trace with hash 28699145, now seen corresponding path program 1 times [2018-11-23 13:41:07,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:41:07,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:41:07,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:07,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:41:07,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:41:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:41:08,077 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:41:08,078 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:41:08,078 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:41:08,078 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:41:08,078 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:41:08,078 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:41:08,079 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:41:08,079 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:41:08,079 INFO L131 ssoRankerPreferences]: Filename of dumped script: sanfoundry_24_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-23 13:41:08,079 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:41:08,079 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:41:08,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:08,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:08,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:08,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:08,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:08,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:08,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:08,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:08,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:08,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:08,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:08,334 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:41:08,338 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:41:08,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:41:08,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:08,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:41:08,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:41:08,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:08,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:08,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:41:08,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:41:08,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:41:08,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:41:08,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:08,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:41:08,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:41:08,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:08,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:08,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:41:08,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:41:08,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:41:08,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 [2018-11-23 13:41:08,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:08,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:41:08,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:41:08,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:08,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:08,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:41:08,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:41:08,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:41:08,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:41:08,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:08,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:41:08,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:41:08,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:08,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:08,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:41:08,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:41:08,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:41:08,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:41:08,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:08,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:41:08,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:08,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:08,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:41:08,362 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:41:08,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:41:08,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:41:08,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:08,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:41:08,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:08,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:08,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:41:08,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:41:08,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:41:08,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:41:08,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:08,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:41:08,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:08,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:08,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:41:08,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:41:08,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:41:08,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:41:08,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:08,389 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:41:08,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:08,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:08,391 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:41:08,392 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:41:08,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:41:08,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:41:08,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:08,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:41:08,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:41:08,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:08,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:08,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:41:08,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:41:08,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:41:08,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:41:08,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:08,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:41:08,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:08,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:08,412 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:41:08,412 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:41:08,437 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:41:08,467 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 13:41:08,467 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 13:41:08,469 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:41:08,470 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:41:08,471 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:41:08,471 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#array~0.base)_1, ULTIMATE.start_main_~#array~0.offset) = -4*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~#array~0.base)_1 - 1*ULTIMATE.start_main_~#array~0.offset Supporting invariants [] [2018-11-23 13:41:08,486 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-23 13:41:08,491 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 13:41:08,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:41:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:41:08,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:41:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:41:08,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:41:08,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:41:08,547 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 13:41:08,548 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 3 states. [2018-11-23 13:41:08,601 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 3 states. Result 43 states and 62 transitions. Complement of second has 8 states. [2018-11-23 13:41:08,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 13:41:08,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:41:08,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-11-23 13:41:08,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-23 13:41:08,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:41:08,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-23 13:41:08,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:41:08,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-23 13:41:08,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:41:08,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 62 transitions. [2018-11-23 13:41:08,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 13:41:08,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2018-11-23 13:41:08,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 13:41:08,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 13:41:08,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2018-11-23 13:41:08,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:41:08,615 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-23 13:41:08,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2018-11-23 13:41:08,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 13:41:08,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:41:08,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-11-23 13:41:08,633 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-23 13:41:08,633 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-23 13:41:08,633 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 13:41:08,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2018-11-23 13:41:08,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 13:41:08,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:41:08,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:41:08,634 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 13:41:08,635 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 13:41:08,635 INFO L794 eck$LassoCheckResult]: Stem: 121#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 117#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem3, main_#t~post1, main_#t~mem5, main_#t~mem6, main_#t~post4, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~num~0;call main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc(400000);havoc main_~i~0;main_~num~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := 0; 118#L15-3 assume !(main_~i~0 < main_~num~0); 122#L15-4 main_~i~0 := 0; 114#L22-3 [2018-11-23 13:41:08,635 INFO L796 eck$LassoCheckResult]: Loop: 114#L22-3 assume !!(main_~i~0 < main_~num~0);call main_#t~mem5 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); 115#L24 assume !(0 != (if main_#t~mem5 < 0 && 0 != main_#t~mem5 % 2 then main_#t~mem5 % 2 - 2 else main_#t~mem5 % 2));havoc main_#t~mem5; 113#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 114#L22-3 [2018-11-23 13:41:08,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:41:08,635 INFO L82 PathProgramCache]: Analyzing trace with hash 925722, now seen corresponding path program 1 times [2018-11-23 13:41:08,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:41:08,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:41:08,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:08,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:41:08,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:41:08,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:41:08,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:41:08,644 INFO L82 PathProgramCache]: Analyzing trace with hash 69000, now seen corresponding path program 1 times [2018-11-23 13:41:08,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:41:08,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:41:08,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:08,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:41:08,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:41:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:41:08,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:41:08,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1808419535, now seen corresponding path program 1 times [2018-11-23 13:41:08,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:41:08,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:41:08,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:08,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:41:08,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:41:08,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:41:08,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:41:08,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:41:08,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:41:08,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:41:08,766 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-23 13:41:08,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:41:08,792 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-23 13:41:08,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:41:08,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2018-11-23 13:41:08,794 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:41:08,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 28 transitions. [2018-11-23 13:41:08,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-23 13:41:08,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-23 13:41:08,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2018-11-23 13:41:08,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:41:08,795 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-11-23 13:41:08,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2018-11-23 13:41:08,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 14. [2018-11-23 13:41:08,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:41:08,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-11-23 13:41:08,797 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-23 13:41:08,797 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-23 13:41:08,797 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 13:41:08,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2018-11-23 13:41:08,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:41:08,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:41:08,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:41:08,798 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:41:08,798 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 13:41:08,798 INFO L794 eck$LassoCheckResult]: Stem: 171#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 168#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem3, main_#t~post1, main_#t~mem5, main_#t~mem6, main_#t~post4, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~num~0;call main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc(400000);havoc main_~i~0;main_~num~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := 0; 169#L15-3 assume !!(main_~i~0 < main_~num~0);call main_#t~mem2 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); 161#L17 assume !(0 == (if main_#t~mem2 < 0 && 0 != main_#t~mem2 % 2 then main_#t~mem2 % 2 - 2 else main_#t~mem2 % 2));havoc main_#t~mem2; 162#L15-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 174#L15-3 assume !(main_~i~0 < main_~num~0); 173#L15-4 main_~i~0 := 0; 166#L22-3 [2018-11-23 13:41:08,798 INFO L796 eck$LassoCheckResult]: Loop: 166#L22-3 assume !!(main_~i~0 < main_~num~0);call main_#t~mem5 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); 167#L24 assume !(0 != (if main_#t~mem5 < 0 && 0 != main_#t~mem5 % 2 then main_#t~mem5 % 2 - 2 else main_#t~mem5 % 2));havoc main_#t~mem5; 165#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 166#L22-3 [2018-11-23 13:41:08,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:41:08,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1810074848, now seen corresponding path program 1 times [2018-11-23 13:41:08,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:41:08,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:41:08,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:08,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:41:08,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:41:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:41:08,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:41:08,814 INFO L82 PathProgramCache]: Analyzing trace with hash 69000, now seen corresponding path program 2 times [2018-11-23 13:41:08,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:41:08,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:41:08,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:08,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:41:08,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:41:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:41:08,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:41:08,823 INFO L82 PathProgramCache]: Analyzing trace with hash 625434697, now seen corresponding path program 1 times [2018-11-23 13:41:08,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:41:08,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:41:08,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:08,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:41:08,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:41:08,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:41:08,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:41:08,976 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ceb1075b-a471-4cf6-b64c-7301130c02fc/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:41:08,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:41:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:41:08,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:41:09,093 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 27 treesize of output 21 [2018-11-23 13:41:09,096 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 21 treesize of output 11 [2018-11-23 13:41:09,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:41:09,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:41:09,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:41:09,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:11 [2018-11-23 13:41:09,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:41:09,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:41:09,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 13:41:09,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:41:09,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:41:09,177 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 8 states. [2018-11-23 13:41:09,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:41:09,255 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-23 13:41:09,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:41:09,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2018-11-23 13:41:09,256 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 13:41:09,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 42 transitions. [2018-11-23 13:41:09,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 13:41:09,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 13:41:09,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2018-11-23 13:41:09,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:41:09,257 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-23 13:41:09,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2018-11-23 13:41:09,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 23. [2018-11-23 13:41:09,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:41:09,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-11-23 13:41:09,259 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-23 13:41:09,259 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-23 13:41:09,260 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 13:41:09,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2018-11-23 13:41:09,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:41:09,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:41:09,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:41:09,261 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:41:09,261 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 13:41:09,261 INFO L794 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 260#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem3, main_#t~post1, main_#t~mem5, main_#t~mem6, main_#t~post4, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~num~0;call main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc(400000);havoc main_~i~0;main_~num~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := 0; 261#L15-3 assume !!(main_~i~0 < main_~num~0);call main_#t~mem2 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); 252#L17 assume !(0 == (if main_#t~mem2 < 0 && 0 != main_#t~mem2 % 2 then main_#t~mem2 % 2 - 2 else main_#t~mem2 % 2));havoc main_#t~mem2; 253#L15-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 266#L15-3 assume !(main_~i~0 < main_~num~0); 265#L15-4 main_~i~0 := 0; 257#L22-3 assume !!(main_~i~0 < main_~num~0);call main_#t~mem5 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); 258#L24 assume 0 != (if main_#t~mem5 < 0 && 0 != main_#t~mem5 % 2 then main_#t~mem5 % 2 - 2 else main_#t~mem5 % 2);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4);printOdd_#in~i := main_#t~mem6;havoc printOdd_~i;printOdd_~i := printOdd_#in~i;__VERIFIER_assert_#in~cond := (if 0 != (if printOdd_~i < 0 && 0 != printOdd_~i % 2 then printOdd_~i % 2 - 2 else printOdd_~i % 2) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 262#L3-4 [2018-11-23 13:41:09,261 INFO L796 eck$LassoCheckResult]: Loop: 262#L3-4 assume !(0 == __VERIFIER_assert_~cond); 255#L3-7 havoc main_#t~mem6; 256#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 259#L22-3 assume !!(main_~i~0 < main_~num~0);call main_#t~mem5 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); 269#L24 assume 0 != (if main_#t~mem5 < 0 && 0 != main_#t~mem5 % 2 then main_#t~mem5 % 2 - 2 else main_#t~mem5 % 2);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4);printOdd_#in~i := main_#t~mem6;havoc printOdd_~i;printOdd_~i := printOdd_#in~i;__VERIFIER_assert_#in~cond := (if 0 != (if printOdd_~i < 0 && 0 != printOdd_~i % 2 then printOdd_~i % 2 - 2 else printOdd_~i % 2) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 262#L3-4 [2018-11-23 13:41:09,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:41:09,261 INFO L82 PathProgramCache]: Analyzing trace with hash 20175299, now seen corresponding path program 1 times [2018-11-23 13:41:09,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:41:09,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:41:09,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:09,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:41:09,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:41:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:41:09,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:41:09,286 INFO L82 PathProgramCache]: Analyzing trace with hash 75485879, now seen corresponding path program 1 times [2018-11-23 13:41:09,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:41:09,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:41:09,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:09,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:41:09,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:41:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:41:09,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:41:09,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1641529909, now seen corresponding path program 1 times [2018-11-23 13:41:09,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:41:09,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:41:09,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:09,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:41:09,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:41:09,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:41:09,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:41:09,355 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ceb1075b-a471-4cf6-b64c-7301130c02fc/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:41:09,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:41:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:41:09,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:41:09,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:41:09,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:41:09,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-23 13:41:09,603 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 42 [2018-11-23 13:41:09,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:41:09,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:41:09,604 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. cyclomatic complexity: 9 Second operand 10 states. [2018-11-23 13:41:09,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:41:09,695 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-11-23 13:41:09,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:41:09,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 69 transitions. [2018-11-23 13:41:09,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:41:09,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 47 states and 57 transitions. [2018-11-23 13:41:09,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-23 13:41:09,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-23 13:41:09,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 57 transitions. [2018-11-23 13:41:09,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:41:09,699 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2018-11-23 13:41:09,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 57 transitions. [2018-11-23 13:41:09,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 29. [2018-11-23 13:41:09,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:41:09,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2018-11-23 13:41:09,701 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-11-23 13:41:09,701 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-11-23 13:41:09,701 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 13:41:09,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2018-11-23 13:41:09,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 13:41:09,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:41:09,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:41:09,702 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-23 13:41:09,703 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 13:41:09,703 INFO L794 eck$LassoCheckResult]: Stem: 401#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 399#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem3, main_#t~post1, main_#t~mem5, main_#t~mem6, main_#t~post4, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~num~0;call main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc(400000);havoc main_~i~0;main_~num~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := 0; 400#L15-3 assume !!(main_~i~0 < main_~num~0);call main_#t~mem2 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); 404#L17 assume !(0 == (if main_#t~mem2 < 0 && 0 != main_#t~mem2 % 2 then main_#t~mem2 % 2 - 2 else main_#t~mem2 % 2));havoc main_#t~mem2; 406#L15-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 407#L15-3 assume !!(main_~i~0 < main_~num~0);call main_#t~mem2 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); 413#L17 assume !(0 == (if main_#t~mem2 < 0 && 0 != main_#t~mem2 % 2 then main_#t~mem2 % 2 - 2 else main_#t~mem2 % 2));havoc main_#t~mem2; 411#L15-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 412#L15-3 assume !(main_~i~0 < main_~num~0); 403#L15-4 main_~i~0 := 0; 395#L22-3 assume !!(main_~i~0 < main_~num~0);call main_#t~mem5 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); 396#L24 assume 0 != (if main_#t~mem5 < 0 && 0 != main_#t~mem5 % 2 then main_#t~mem5 % 2 - 2 else main_#t~mem5 % 2);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4);printOdd_#in~i := main_#t~mem6;havoc printOdd_~i;printOdd_~i := printOdd_#in~i;__VERIFIER_assert_#in~cond := (if 0 != (if printOdd_~i < 0 && 0 != printOdd_~i % 2 then printOdd_~i % 2 - 2 else printOdd_~i % 2) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 398#L3-4 [2018-11-23 13:41:09,703 INFO L796 eck$LassoCheckResult]: Loop: 398#L3-4 assume !(0 == __VERIFIER_assert_~cond); 393#L3-7 havoc main_#t~mem6; 394#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 397#L22-3 assume !!(main_~i~0 < main_~num~0);call main_#t~mem5 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); 410#L24 assume 0 != (if main_#t~mem5 < 0 && 0 != main_#t~mem5 % 2 then main_#t~mem5 % 2 - 2 else main_#t~mem5 % 2);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4);printOdd_#in~i := main_#t~mem6;havoc printOdd_~i;printOdd_~i := printOdd_#in~i;__VERIFIER_assert_#in~cond := (if 0 != (if printOdd_~i < 0 && 0 != printOdd_~i % 2 then printOdd_~i % 2 - 2 else printOdd_~i % 2) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 398#L3-4 [2018-11-23 13:41:09,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:41:09,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1338079421, now seen corresponding path program 2 times [2018-11-23 13:41:09,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:41:09,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:41:09,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:09,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:41:09,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:41:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:41:09,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:41:09,735 INFO L82 PathProgramCache]: Analyzing trace with hash 75485879, now seen corresponding path program 2 times [2018-11-23 13:41:09,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:41:09,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:41:09,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:09,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:41:09,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:41:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:41:09,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:41:09,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1807249275, now seen corresponding path program 2 times [2018-11-23 13:41:09,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:41:09,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:41:09,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:09,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:41:09,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:41:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:41:09,941 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 42 [2018-11-23 13:41:10,061 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 98 [2018-11-23 13:41:10,363 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 55 [2018-11-23 13:41:10,364 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:41:10,364 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:41:10,364 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:41:10,364 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:41:10,364 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:41:10,364 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:41:10,364 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:41:10,364 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:41:10,365 INFO L131 ssoRankerPreferences]: Filename of dumped script: sanfoundry_24_true-unreach-call_true-termination.i_Iteration5_Lasso [2018-11-23 13:41:10,365 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:41:10,365 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:41:10,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:10,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:10,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:10,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:10,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:10,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:10,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:10,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:10,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:10,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:10,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:10,694 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:41:10,694 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:41:10,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:41:10,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:10,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:41:10,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:41:10,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:10,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:10,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:41:10,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:41:10,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:41:10,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:41:10,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:10,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:41:10,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:41:10,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:10,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:10,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:41:10,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:41:10,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:41:10,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:41:10,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:10,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:41:10,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:41:10,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:10,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:10,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:41:10,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:41:10,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:41:10,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:41:10,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:10,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:41:10,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:41:10,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:10,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:10,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:41:10,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:41:10,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:41:10,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:41:10,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:10,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:41:10,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:41:10,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:10,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:10,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:41:10,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:41:10,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:41:10,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:41:10,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:10,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:41:10,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:10,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:10,706 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:41:10,706 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:41:10,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:41:10,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:41:10,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:10,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:41:10,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:41:10,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:10,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:10,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:41:10,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:41:10,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:41:10,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:41:10,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:10,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:41:10,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:41:10,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:10,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:10,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:41:10,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:41:10,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:41:10,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:41:10,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:10,711 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:41:10,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:10,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:10,712 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:41:10,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:41:10,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:41:10,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:41:10,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:10,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:41:10,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:10,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:10,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:41:10,716 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:41:10,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:41:10,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:41:10,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:10,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:41:10,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:10,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:10,720 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:41:10,720 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:41:10,731 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:41:10,740 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 13:41:10,740 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 13:41:10,740 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:41:10,741 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:41:10,741 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:41:10,741 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#array~0.base)_2, ULTIMATE.start_main_~#array~0.offset) = -4*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~#array~0.base)_2 - 1*ULTIMATE.start_main_~#array~0.offset Supporting invariants [] [2018-11-23 13:41:10,764 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 13:41:10,765 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 13:41:10,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:41:10,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:41:10,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:41:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:41:10,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:41:10,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:41:10,808 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 13:41:10,808 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-23 13:41:10,827 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 39 states and 48 transitions. Complement of second has 6 states. [2018-11-23 13:41:10,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 13:41:10,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:41:10,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-23 13:41:10,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-23 13:41:10,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:41:10,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 17 letters. Loop has 5 letters. [2018-11-23 13:41:10,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:41:10,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-23 13:41:10,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:41:10,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2018-11-23 13:41:10,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 13:41:10,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 17 states and 19 transitions. [2018-11-23 13:41:10,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-23 13:41:10,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-23 13:41:10,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2018-11-23 13:41:10,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:41:10,831 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-23 13:41:10,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2018-11-23 13:41:10,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 13:41:10,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:41:10,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-23 13:41:10,832 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-23 13:41:10,833 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-23 13:41:10,833 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 13:41:10,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2018-11-23 13:41:10,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 13:41:10,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:41:10,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:41:10,836 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:41:10,836 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 13:41:10,837 INFO L794 eck$LassoCheckResult]: Stem: 549#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 545#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem3, main_#t~post1, main_#t~mem5, main_#t~mem6, main_#t~post4, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~num~0;call main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc(400000);havoc main_~i~0;main_~num~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := 0; 546#L15-3 assume !!(main_~i~0 < main_~num~0);call main_#t~mem2 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); 552#L17 assume 0 == (if main_#t~mem2 < 0 && 0 != main_#t~mem2 % 2 then main_#t~mem2 % 2 - 2 else main_#t~mem2 % 2);havoc main_#t~mem2;call main_#t~mem3 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4);printEven_#in~i := main_#t~mem3;havoc printEven_~i;printEven_~i := printEven_#in~i;__VERIFIER_assert_#in~cond := (if 0 == (if printEven_~i < 0 && 0 != printEven_~i % 2 then printEven_~i % 2 - 2 else printEven_~i % 2) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 553#L3 assume !(0 == __VERIFIER_assert_~cond); 547#L3-3 havoc main_#t~mem3; 548#L15-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 554#L15-3 assume !!(main_~i~0 < main_~num~0);call main_#t~mem2 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); 555#L17 assume !(0 == (if main_#t~mem2 < 0 && 0 != main_#t~mem2 % 2 then main_#t~mem2 % 2 - 2 else main_#t~mem2 % 2));havoc main_#t~mem2; 559#L15-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 558#L15-3 assume !(main_~i~0 < main_~num~0); 550#L15-4 main_~i~0 := 0; 551#L22-3 [2018-11-23 13:41:10,837 INFO L796 eck$LassoCheckResult]: Loop: 551#L22-3 assume !!(main_~i~0 < main_~num~0);call main_#t~mem5 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * main_~i~0, 4); 556#L24 assume !(0 != (if main_#t~mem5 < 0 && 0 != main_#t~mem5 % 2 then main_#t~mem5 % 2 - 2 else main_#t~mem5 % 2));havoc main_#t~mem5; 557#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 551#L22-3 [2018-11-23 13:41:10,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:41:10,837 INFO L82 PathProgramCache]: Analyzing trace with hash 932632081, now seen corresponding path program 1 times [2018-11-23 13:41:10,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:41:10,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:41:10,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:10,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:41:10,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:41:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:41:10,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:41:10,851 INFO L82 PathProgramCache]: Analyzing trace with hash 69000, now seen corresponding path program 3 times [2018-11-23 13:41:10,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:41:10,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:41:10,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:10,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:41:10,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:41:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:41:10,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:41:10,856 INFO L82 PathProgramCache]: Analyzing trace with hash -101073544, now seen corresponding path program 1 times [2018-11-23 13:41:10,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:41:10,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:41:10,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:10,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:41:10,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:41:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:41:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:41:11,141 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 49 [2018-11-23 13:41:11,143 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:41:11,143 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:41:11,143 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:41:11,143 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:41:11,143 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:41:11,143 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:41:11,143 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:41:11,143 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:41:11,143 INFO L131 ssoRankerPreferences]: Filename of dumped script: sanfoundry_24_true-unreach-call_true-termination.i_Iteration6_Lasso [2018-11-23 13:41:11,143 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:41:11,143 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:41:11,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:11,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:11,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:11,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:11,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:11,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:11,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:11,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:11,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:11,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:11,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:11,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:41:11,340 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:41:11,341 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:41:11,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:41:11,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:11,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:41:11,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:11,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:11,342 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:41:11,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:41:11,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:41:11,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:41:11,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:11,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:41:11,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:41:11,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:11,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:11,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:41:11,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:41:11,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:41:11,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:41:11,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:11,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:41:11,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:41:11,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:11,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:11,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:41:11,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:41:11,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:41:11,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 [2018-11-23 13:41:11,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:11,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:41:11,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:41:11,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:11,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:11,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:41:11,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:41:11,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:41:11,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:41:11,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:11,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:41:11,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:11,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:11,352 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:41:11,352 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:41:11,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:41:11,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:41:11,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:11,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:41:11,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:41:11,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:11,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:11,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:41:11,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:41:11,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:41:11,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:41:11,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:11,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:41:11,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:41:11,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:11,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:11,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:41:11,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:41:11,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:41:11,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:41:11,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:11,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:41:11,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:11,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:11,358 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:41:11,358 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:41:11,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:41:11,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:41:11,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:11,359 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:41:11,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:11,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:11,360 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:41:11,360 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:41:11,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:41:11,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:41:11,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:41:11,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:41:11,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:41:11,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:41:11,364 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:41:11,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:41:11,370 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:41:11,375 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 13:41:11,375 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 13:41:11,376 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:41:11,376 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:41:11,377 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:41:11,377 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~num~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~num~0 Supporting invariants [] [2018-11-23 13:41:11,395 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-23 13:41:11,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:41:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:41:11,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:41:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:41:11,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:41:11,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:41:11,430 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 13:41:11,430 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-23 13:41:11,435 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 20 states and 23 transitions. Complement of second has 4 states. [2018-11-23 13:41:11,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 13:41:11,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:41:11,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2018-11-23 13:41:11,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-23 13:41:11,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:41:11,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 13:41:11,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:41:11,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-23 13:41:11,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:41:11,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2018-11-23 13:41:11,438 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 13:41:11,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2018-11-23 13:41:11,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 13:41:11,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 13:41:11,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 13:41:11,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:41:11,438 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:41:11,439 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:41:11,439 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:41:11,439 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 13:41:11,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:41:11,439 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 13:41:11,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 13:41:11,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 01:41:11 BoogieIcfgContainer [2018-11-23 13:41:11,444 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 13:41:11,444 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:41:11,444 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:41:11,444 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:41:11,445 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:41:07" (3/4) ... [2018-11-23 13:41:11,447 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 13:41:11,447 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:41:11,448 INFO L168 Benchmark]: Toolchain (without parser) took 4149.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 959.2 MB in the beginning and 931.7 MB in the end (delta: 27.6 MB). Peak memory consumption was 188.0 MB. Max. memory is 11.5 GB. [2018-11-23 13:41:11,449 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:41:11,449 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.23 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-23 13:41:11,449 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.61 ms. Allocated memory is still 1.0 GB. Free memory was 948.3 MB in the beginning and 945.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:41:11,450 INFO L168 Benchmark]: Boogie Preprocessor took 53.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-23 13:41:11,450 INFO L168 Benchmark]: RCFGBuilder took 161.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-23 13:41:11,451 INFO L168 Benchmark]: BuchiAutomizer took 3740.76 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.1 GB in the beginning and 931.7 MB in the end (delta: 156.0 MB). Peak memory consumption was 206.3 MB. Max. memory is 11.5 GB. [2018-11-23 13:41:11,451 INFO L168 Benchmark]: Witness Printer took 3.46 ms. Allocated memory is still 1.2 GB. Free memory is still 931.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:41:11,453 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 163.23 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.61 ms. Allocated memory is still 1.0 GB. Free memory was 948.3 MB in the beginning and 945.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 161.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3740.76 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.1 GB in the beginning and 931.7 MB in the end (delta: 156.0 MB). Peak memory consumption was 206.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.46 ms. Allocated memory is still 1.2 GB. Free memory is still 931.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[array] + -1 * array and consists of 5 locations. One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[array] + -1 * array and consists of 4 locations. One deterministic module has affine ranking function -1 * i + num and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 3.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 39 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 67 SDtfs, 116 SDslu, 110 SDs, 0 SdLazy, 142 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital123 mio100 ax100 hnf100 lsp89 ukn71 mio100 lsp53 div213 bol100 ite100 ukn100 eq153 hnf57 smp93 dnf100 smp100 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...