./Ultimate.py --spec ../../sv-benchmarks/c/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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3f70b6f7-2a07-4488-8ce5-0042a629baee/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3f70b6f7-2a07-4488-8ce5-0042a629baee/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3f70b6f7-2a07-4488-8ce5-0042a629baee/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3f70b6f7-2a07-4488-8ce5-0042a629baee/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_3f70b6f7-2a07-4488-8ce5-0042a629baee/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3f70b6f7-2a07-4488-8ce5-0042a629baee/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-5842f4b [2018-11-18 16:15:20,374 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:15:20,375 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:15:20,382 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:15:20,382 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:15:20,383 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:15:20,384 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:15:20,385 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:15:20,386 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:15:20,386 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:15:20,387 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:15:20,387 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:15:20,388 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:15:20,388 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:15:20,389 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:15:20,390 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:15:20,390 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:15:20,391 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:15:20,393 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:15:20,394 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:15:20,394 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:15:20,395 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:15:20,397 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:15:20,397 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:15:20,397 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:15:20,398 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:15:20,399 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:15:20,399 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:15:20,400 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:15:20,400 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:15:20,401 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:15:20,401 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:15:20,401 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:15:20,401 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:15:20,402 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:15:20,402 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:15:20,403 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3f70b6f7-2a07-4488-8ce5-0042a629baee/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 16:15:20,413 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:15:20,413 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:15:20,414 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 16:15:20,414 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 16:15:20,414 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 16:15:20,415 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 16:15:20,415 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 16:15:20,415 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 16:15:20,415 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 16:15:20,415 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 16:15:20,415 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 16:15:20,415 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:15:20,415 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:15:20,416 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 16:15:20,416 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:15:20,416 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:15:20,416 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:15:20,416 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 16:15:20,416 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 16:15:20,416 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 16:15:20,416 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:15:20,417 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:15:20,417 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 16:15:20,417 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:15:20,417 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 16:15:20,417 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:15:20,417 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:15:20,417 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 16:15:20,418 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:15:20,418 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 16:15:20,418 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 16:15:20,419 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 16:15:20,419 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_3f70b6f7-2a07-4488-8ce5-0042a629baee/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-18 16:15:20,442 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:15:20,451 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:15:20,454 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:15:20,455 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:15:20,455 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:15:20,456 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3f70b6f7-2a07-4488-8ce5-0042a629baee/bin-2019/uautomizer/../../sv-benchmarks/c/array-examples/sanfoundry_24_true-unreach-call_true-termination.i [2018-11-18 16:15:20,497 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f70b6f7-2a07-4488-8ce5-0042a629baee/bin-2019/uautomizer/data/299b4d9e5/f94df63f98fe450cb25c45024ac02ccf/FLAG7fdc01a9d [2018-11-18 16:15:20,895 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:15:20,895 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3f70b6f7-2a07-4488-8ce5-0042a629baee/sv-benchmarks/c/array-examples/sanfoundry_24_true-unreach-call_true-termination.i [2018-11-18 16:15:20,899 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f70b6f7-2a07-4488-8ce5-0042a629baee/bin-2019/uautomizer/data/299b4d9e5/f94df63f98fe450cb25c45024ac02ccf/FLAG7fdc01a9d [2018-11-18 16:15:20,907 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3f70b6f7-2a07-4488-8ce5-0042a629baee/bin-2019/uautomizer/data/299b4d9e5/f94df63f98fe450cb25c45024ac02ccf [2018-11-18 16:15:20,909 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:15:20,910 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:15:20,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:15:20,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:15:20,913 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:15:20,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:15:20" (1/1) ... [2018-11-18 16:15:20,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63295877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:15:20, skipping insertion in model container [2018-11-18 16:15:20,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:15:20" (1/1) ... [2018-11-18 16:15:20,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:15:20,933 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:15:21,037 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:15:21,040 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:15:21,051 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:15:21,063 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:15:21,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:15:21 WrapperNode [2018-11-18 16:15:21,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:15:21,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:15:21,064 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:15:21,064 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:15:21,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:15:21" (1/1) ... [2018-11-18 16:15:21,074 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:15:21" (1/1) ... [2018-11-18 16:15:21,086 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:15:21,086 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:15:21,086 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:15:21,086 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:15:21,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:15:21" (1/1) ... [2018-11-18 16:15:21,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:15:21" (1/1) ... [2018-11-18 16:15:21,093 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:15:21" (1/1) ... [2018-11-18 16:15:21,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:15:21" (1/1) ... [2018-11-18 16:15:21,096 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:15:21" (1/1) ... [2018-11-18 16:15:21,134 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:15:21" (1/1) ... [2018-11-18 16:15:21,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:15:21" (1/1) ... [2018-11-18 16:15:21,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:15:21,137 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:15:21,137 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:15:21,137 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:15:21,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:15:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f70b6f7-2a07-4488-8ce5-0042a629baee/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-18 16:15:21,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 16:15:21,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:15:21,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:15:21,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 16:15:21,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 16:15:21,351 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:15:21,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:15:21 BoogieIcfgContainer [2018-11-18 16:15:21,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:15:21,352 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 16:15:21,352 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 16:15:21,355 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 16:15:21,356 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:15:21,356 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 04:15:20" (1/3) ... [2018-11-18 16:15:21,357 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f66dbb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 04:15:21, skipping insertion in model container [2018-11-18 16:15:21,357 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:15:21,357 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:15:21" (2/3) ... [2018-11-18 16:15:21,357 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f66dbb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 04:15:21, skipping insertion in model container [2018-11-18 16:15:21,358 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:15:21,358 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:15:21" (3/3) ... [2018-11-18 16:15:21,359 INFO L375 chiAutomizerObserver]: Analyzing ICFG sanfoundry_24_true-unreach-call_true-termination.i [2018-11-18 16:15:21,406 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 16:15:21,406 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 16:15:21,406 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 16:15:21,407 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 16:15:21,407 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:15:21,407 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:15:21,407 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 16:15:21,407 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:15:21,407 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 16:15:21,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-18 16:15:21,439 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-18 16:15:21,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:15:21,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:15:21,445 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 16:15:21,446 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 16:15:21,446 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 16:15:21,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-18 16:15:21,447 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-18 16:15:21,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:15:21,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:15:21,448 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 16:15:21,448 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 16:15:21,455 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 17#L15-4true [2018-11-18 16:15:21,455 INFO L796 eck$LassoCheckResult]: Loop: 17#L15-4true assume true; 24#L15-1true 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-3true main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 17#L15-4true [2018-11-18 16:15:21,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:21,460 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 16:15:21,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:15:21,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:15:21,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:21,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:15:21,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:15:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:15:21,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:21,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1113704, now seen corresponding path program 1 times [2018-11-18 16:15:21,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:15:21,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:15:21,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:21,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:15:21,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:15:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:15:21,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:21,557 INFO L82 PathProgramCache]: Analyzing trace with hash 889540906, now seen corresponding path program 1 times [2018-11-18 16:15:21,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:15:21,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:15:21,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:21,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:15:21,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:15:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:15:21,775 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:15:21,776 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:15:21,776 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:15:21,776 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:15:21,776 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:15:21,776 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:15:21,776 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:15:21,776 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:15:21,776 INFO L131 ssoRankerPreferences]: Filename of dumped script: sanfoundry_24_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-18 16:15:21,777 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:15:21,777 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:15:21,796 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-18 16:15:21,800 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-18 16:15:21,813 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-18 16:15:21,821 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-18 16:15:21,823 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-18 16:15:21,827 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-18 16:15:21,863 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-18 16:15:21,864 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-18 16:15:21,866 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-18 16:15:21,867 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-18 16:15:21,868 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-18 16:15:22,003 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:15:22,006 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:15:22,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:15:22,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:22,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:15:22,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:15:22,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:22,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:22,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:15:22,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:15:22,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:15:22,014 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-18 16:15:22,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:22,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:15:22,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:15:22,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:22,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:22,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:15:22,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:15:22,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:15:22,017 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-18 16:15:22,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:22,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:15:22,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:15:22,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:22,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:22,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:15:22,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:15:22,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:15:22,019 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-18 16:15:22,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:22,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:15:22,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:15:22,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:22,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:22,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:15:22,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:15:22,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:15:22,022 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-18 16:15:22,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:22,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:15:22,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:22,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:22,025 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:15:22,025 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:15:22,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:15:22,027 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-18 16:15:22,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:22,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:15:22,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:22,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:22,029 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:15:22,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:15:22,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:15:22,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:15:22,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:22,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:15:22,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:22,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:22,034 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:15:22,034 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:15:22,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:15:22,041 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-18 16:15:22,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:22,042 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:15:22,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:22,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:22,044 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:15:22,044 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:15:22,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:15:22,050 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-18 16:15:22,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:22,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:15:22,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:15:22,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:22,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:22,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:15:22,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:15:22,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:15:22,056 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-18 16:15:22,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:22,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:15:22,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:22,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:22,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:15:22,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:15:22,084 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:15:22,112 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 16:15:22,112 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 16:15:22,114 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:15:22,115 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 16:15:22,115 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:15:22,116 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-18 16:15:22,118 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-18 16:15:22,122 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 16:15:22,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:15:22,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:15:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:15:22,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:15:22,176 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-18 16:15:22,186 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-18 16:15:22,187 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states. Second operand 4 states. [2018-11-18 16:15:22,242 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states.. Second operand 4 states. Result 53 states and 70 transitions. Complement of second has 8 states. [2018-11-18 16:15:22,243 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-18 16:15:22,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 16:15:22,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2018-11-18 16:15:22,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-18 16:15:22,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:15:22,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-18 16:15:22,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:15:22,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-18 16:15:22,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:15:22,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 70 transitions. [2018-11-18 16:15:22,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 16:15:22,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 20 states and 25 transitions. [2018-11-18 16:15:22,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 16:15:22,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-18 16:15:22,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2018-11-18 16:15:22,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:15:22,257 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-18 16:15:22,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2018-11-18 16:15:22,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-18 16:15:22,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 16:15:22,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-11-18 16:15:22,277 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-18 16:15:22,277 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-18 16:15:22,278 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 16:15:22,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2018-11-18 16:15:22,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 16:15:22,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:15:22,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:15:22,279 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 16:15:22,279 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 16:15:22,279 INFO L794 eck$LassoCheckResult]: Stem: 140#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 136#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 137#L15-4 assume true; 144#L15-1 assume !(main_~i~0 < main_~num~0); 138#L15-5 main_~i~0 := 0; 132#L22-4 [2018-11-18 16:15:22,279 INFO L796 eck$LassoCheckResult]: Loop: 132#L22-4 assume true; 133#L22-1 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); 139#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; 131#L22-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 132#L22-4 [2018-11-18 16:15:22,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:22,280 INFO L82 PathProgramCache]: Analyzing trace with hash 28694811, now seen corresponding path program 1 times [2018-11-18 16:15:22,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:15:22,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:15:22,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:22,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:15:22,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:15:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:15:22,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:22,288 INFO L82 PathProgramCache]: Analyzing trace with hash 2068008, now seen corresponding path program 1 times [2018-11-18 16:15:22,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:15:22,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:15:22,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:22,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:15:22,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:15:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:15:22,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:22,298 INFO L82 PathProgramCache]: Analyzing trace with hash 313477698, now seen corresponding path program 1 times [2018-11-18 16:15:22,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:15:22,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:15:22,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:22,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:15:22,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:15:22,346 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-18 16:15:22,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:15:22,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:15:22,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:15:22,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:15:22,409 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-18 16:15:22,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:15:22,442 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-11-18 16:15:22,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 16:15:22,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 43 transitions. [2018-11-18 16:15:22,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 16:15:22,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 32 states and 37 transitions. [2018-11-18 16:15:22,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-18 16:15:22,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-18 16:15:22,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 37 transitions. [2018-11-18 16:15:22,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:15:22,445 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-18 16:15:22,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 37 transitions. [2018-11-18 16:15:22,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-11-18 16:15:22,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 16:15:22,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-11-18 16:15:22,447 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-18 16:15:22,447 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-18 16:15:22,447 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 16:15:22,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2018-11-18 16:15:22,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 16:15:22,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:15:22,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:15:22,448 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:15:22,448 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 16:15:22,448 INFO L794 eck$LassoCheckResult]: Stem: 207#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 202#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 203#L15-4 assume true; 210#L15-1 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); 194#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; 195#L15-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 211#L15-4 assume true; 212#L15-1 assume !(main_~i~0 < main_~num~0); 205#L15-5 main_~i~0 := 0; 200#L22-4 [2018-11-18 16:15:22,448 INFO L796 eck$LassoCheckResult]: Loop: 200#L22-4 assume true; 201#L22-1 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); 206#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; 199#L22-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 200#L22-4 [2018-11-18 16:15:22,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:22,449 INFO L82 PathProgramCache]: Analyzing trace with hash 364920404, now seen corresponding path program 1 times [2018-11-18 16:15:22,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:15:22,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:15:22,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:22,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:15:22,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:15:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:15:22,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:22,460 INFO L82 PathProgramCache]: Analyzing trace with hash 2068008, now seen corresponding path program 2 times [2018-11-18 16:15:22,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:15:22,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:15:22,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:22,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:15:22,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:15:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:15:22,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:22,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1541248261, now seen corresponding path program 1 times [2018-11-18 16:15:22,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:15:22,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:15:22,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:22,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:15:22,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:15:22,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:15:22,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:15:22,608 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f70b6f7-2a07-4488-8ce5-0042a629baee/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-18 16:15:22,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:15:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:15:22,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:15:22,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-11-18 16:15:22,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2018-11-18 16:15:22,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:15:22,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:15:22,709 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-18 16:15:22,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:11 [2018-11-18 16:15:22,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:15:22,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:15:22,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 16:15:22,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 16:15:22,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:15:22,787 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand 8 states. [2018-11-18 16:15:22,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:15:22,856 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-11-18 16:15:22,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 16:15:22,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 56 transitions. [2018-11-18 16:15:22,858 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-18 16:15:22,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 56 transitions. [2018-11-18 16:15:22,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-18 16:15:22,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 16:15:22,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 56 transitions. [2018-11-18 16:15:22,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:15:22,859 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-11-18 16:15:22,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 56 transitions. [2018-11-18 16:15:22,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2018-11-18 16:15:22,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 16:15:22,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-18 16:15:22,863 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-18 16:15:22,863 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-18 16:15:22,863 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 16:15:22,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 39 transitions. [2018-11-18 16:15:22,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 16:15:22,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:15:22,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:15:22,864 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:15:22,864 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:15:22,865 INFO L794 eck$LassoCheckResult]: Stem: 327#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 321#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 322#L15-4 assume true; 330#L15-1 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); 313#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; 314#L15-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 334#L15-4 assume true; 336#L15-1 assume !(main_~i~0 < main_~num~0); 337#L15-5 main_~i~0 := 0; 341#L22-4 assume true; 325#L22-1 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); 326#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);assume { :begin_inline_printOdd } true;printOdd_#in~i := main_#t~mem6;havoc printOdd_~i;printOdd_~i := printOdd_#in~i;assume { :begin_inline___VERIFIER_assert } true;__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; 323#L3-4 [2018-11-18 16:15:22,865 INFO L796 eck$LassoCheckResult]: Loop: 323#L3-4 assume !(0 == __VERIFIER_assert_~cond); 316#L3-7 assume { :end_inline___VERIFIER_assert } true; 317#L7 assume { :end_inline_printOdd } true;havoc main_#t~mem6; 318#L22-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 319#L22-4 assume true; 320#L22-1 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); 340#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);assume { :begin_inline_printOdd } true;printOdd_#in~i := main_#t~mem6;havoc printOdd_~i;printOdd_~i := printOdd_#in~i;assume { :begin_inline___VERIFIER_assert } true;__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; 323#L3-4 [2018-11-18 16:15:22,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:22,865 INFO L82 PathProgramCache]: Analyzing trace with hash 781566292, now seen corresponding path program 1 times [2018-11-18 16:15:22,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:15:22,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:15:22,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:22,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:15:22,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:15:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:15:22,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:22,892 INFO L82 PathProgramCache]: Analyzing trace with hash -2047090111, now seen corresponding path program 1 times [2018-11-18 16:15:22,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:15:22,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:15:22,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:22,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:15:22,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:15:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:15:22,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:22,902 INFO L82 PathProgramCache]: Analyzing trace with hash 647794062, now seen corresponding path program 1 times [2018-11-18 16:15:22,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:15:22,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:15:22,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:22,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:15:22,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:15:22,969 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:15:22,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:15:22,970 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f70b6f7-2a07-4488-8ce5-0042a629baee/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-18 16:15:22,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:15:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:15:22,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:15:23,028 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:15:23,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:15:23,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-18 16:15:23,192 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 42 [2018-11-18 16:15:23,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 16:15:23,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-18 16:15:23,193 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. cyclomatic complexity: 9 Second operand 10 states. [2018-11-18 16:15:23,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:15:23,260 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2018-11-18 16:15:23,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 16:15:23,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 94 transitions. [2018-11-18 16:15:23,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 16:15:23,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 66 states and 76 transitions. [2018-11-18 16:15:23,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-18 16:15:23,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-18 16:15:23,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 76 transitions. [2018-11-18 16:15:23,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:15:23,264 INFO L705 BuchiCegarLoop]: Abstraction has 66 states and 76 transitions. [2018-11-18 16:15:23,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 76 transitions. [2018-11-18 16:15:23,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 40. [2018-11-18 16:15:23,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-18 16:15:23,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-11-18 16:15:23,267 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-18 16:15:23,267 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-18 16:15:23,267 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 16:15:23,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 46 transitions. [2018-11-18 16:15:23,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 16:15:23,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:15:23,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:15:23,268 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:15:23,268 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:15:23,268 INFO L794 eck$LassoCheckResult]: Stem: 514#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 509#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~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; 510#L15-4 assume true; 517#L15-1 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); 536#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; 537#L15-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 518#L15-4 assume true; 519#L15-1 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); 501#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; 502#L15-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 525#L15-4 assume true; 523#L15-1 assume !(main_~i~0 < main_~num~0); 524#L15-5 main_~i~0 := 0; 527#L22-4 assume true; 526#L22-1 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); 522#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);assume { :begin_inline_printOdd } true;printOdd_#in~i := main_#t~mem6;havoc printOdd_~i;printOdd_~i := printOdd_#in~i;assume { :begin_inline___VERIFIER_assert } true;__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; 511#L3-4 [2018-11-18 16:15:23,268 INFO L796 eck$LassoCheckResult]: Loop: 511#L3-4 assume !(0 == __VERIFIER_assert_~cond); 504#L3-7 assume { :end_inline___VERIFIER_assert } true; 505#L7 assume { :end_inline_printOdd } true;havoc main_#t~mem6; 506#L22-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 507#L22-4 assume true; 508#L22-1 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); 513#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);assume { :begin_inline_printOdd } true;printOdd_#in~i := main_#t~mem6;havoc printOdd_~i;printOdd_~i := printOdd_#in~i;assume { :begin_inline___VERIFIER_assert } true;__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; 511#L3-4 [2018-11-18 16:15:23,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:23,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1394784763, now seen corresponding path program 2 times [2018-11-18 16:15:23,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:15:23,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:15:23,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:23,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:15:23,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:15:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:15:23,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:23,295 INFO L82 PathProgramCache]: Analyzing trace with hash -2047090111, now seen corresponding path program 2 times [2018-11-18 16:15:23,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:15:23,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:15:23,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:23,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:15:23,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:15:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:15:23,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:23,306 INFO L82 PathProgramCache]: Analyzing trace with hash -202581241, now seen corresponding path program 2 times [2018-11-18 16:15:23,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:15:23,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:15:23,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:23,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:15:23,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:15:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:15:23,495 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 42 [2018-11-18 16:15:23,618 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 98 [2018-11-18 16:15:23,909 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 55 [2018-11-18 16:15:23,910 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:15:23,910 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:15:23,910 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:15:23,911 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:15:23,911 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:15:23,911 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:15:23,911 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:15:23,911 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:15:23,911 INFO L131 ssoRankerPreferences]: Filename of dumped script: sanfoundry_24_true-unreach-call_true-termination.i_Iteration5_Lasso [2018-11-18 16:15:23,911 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:15:23,911 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:15:23,913 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-18 16:15:23,915 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-18 16:15:23,916 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-18 16:15:23,917 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-18 16:15:23,918 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-18 16:15:23,919 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-18 16:15:23,920 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-18 16:15:23,921 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-18 16:15:23,922 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-18 16:15:24,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:15:24,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:15:24,225 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:15:24,225 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:15:24,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:15:24,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:24,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:15:24,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:15:24,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:24,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:24,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:15:24,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:15:24,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:15:24,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:15:24,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:24,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:15:24,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:15:24,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:24,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:24,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:15:24,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:15:24,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:15:24,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:15:24,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:24,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:15:24,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:15:24,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:24,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:24,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:15:24,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:15:24,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:15:24,232 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-18 16:15:24,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:24,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:15:24,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:15:24,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:24,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:24,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:15:24,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:15:24,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:15:24,234 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-18 16:15:24,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:24,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:15:24,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:15:24,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:24,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:24,235 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:15:24,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:15:24,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:15:24,236 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-18 16:15:24,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:24,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:15:24,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:24,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:24,237 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:15:24,237 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:15:24,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:15:24,238 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-18 16:15:24,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:24,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:15:24,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:15:24,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:24,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:24,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:15:24,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:15:24,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:15:24,240 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-18 16:15:24,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:24,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:15:24,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:15:24,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:24,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:24,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:15:24,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:15:24,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:15:24,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:15:24,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:24,242 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:15:24,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:24,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:24,243 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:15:24,243 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:15:24,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:15:24,245 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-18 16:15:24,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:24,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:15:24,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:24,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:24,247 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:15:24,247 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:15:24,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:15:24,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:15:24,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:24,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:15:24,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:24,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:24,252 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:15:24,252 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:15:24,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:15:24,260 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-18 16:15:24,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:24,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:15:24,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:24,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:24,263 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:15:24,263 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:15:24,270 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:15:24,278 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 16:15:24,278 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 16:15:24,278 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:15:24,279 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 16:15:24,279 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:15:24,279 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-18 16:15:24,289 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 16:15:24,293 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 16:15:24,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:24,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:15:24,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:15:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:15:24,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:15:24,339 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-18 16:15:24,340 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-18 16:15:24,340 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 46 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-18 16:15:24,357 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 46 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 53 states and 62 transitions. Complement of second has 6 states. [2018-11-18 16:15:24,358 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-18 16:15:24,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 16:15:24,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-18 16:15:24,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 16 letters. Loop has 7 letters. [2018-11-18 16:15:24,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:15:24,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 23 letters. Loop has 7 letters. [2018-11-18 16:15:24,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:15:24,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 16 letters. Loop has 14 letters. [2018-11-18 16:15:24,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:15:24,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 62 transitions. [2018-11-18 16:15:24,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 16:15:24,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 23 states and 25 transitions. [2018-11-18 16:15:24,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 16:15:24,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 16:15:24,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2018-11-18 16:15:24,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:15:24,361 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-18 16:15:24,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2018-11-18 16:15:24,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-18 16:15:24,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 16:15:24,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-18 16:15:24,363 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-18 16:15:24,363 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-18 16:15:24,363 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 16:15:24,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 25 transitions. [2018-11-18 16:15:24,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 16:15:24,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:15:24,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:15:24,364 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:15:24,364 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 16:15:24,364 INFO L794 eck$LassoCheckResult]: Stem: 710#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 704#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 705#L15-4 assume true; 711#L15-1 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); 699#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);assume { :begin_inline_printEven } true;printEven_#in~i := main_#t~mem3;havoc printEven_~i;printEven_~i := printEven_#in~i;assume { :begin_inline___VERIFIER_assert } true;__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; 700#L3 assume !(0 == __VERIFIER_assert_~cond); 708#L3-3 assume { :end_inline___VERIFIER_assert } true; 709#L4 assume { :end_inline_printEven } true;havoc main_#t~mem3; 714#L15-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 712#L15-4 assume true; 713#L15-1 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); 719#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; 717#L15-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 716#L15-4 assume true; 715#L15-1 assume !(main_~i~0 < main_~num~0); 706#L15-5 main_~i~0 := 0; 701#L22-4 [2018-11-18 16:15:24,364 INFO L796 eck$LassoCheckResult]: Loop: 701#L22-4 assume true; 702#L22-1 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); 707#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; 703#L22-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 701#L22-4 [2018-11-18 16:15:24,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:24,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1255345557, now seen corresponding path program 1 times [2018-11-18 16:15:24,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:15:24,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:15:24,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:24,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:15:24,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:15:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:15:24,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:24,375 INFO L82 PathProgramCache]: Analyzing trace with hash 2068008, now seen corresponding path program 3 times [2018-11-18 16:15:24,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:15:24,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:15:24,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:24,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:15:24,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:15:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:15:24,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:24,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1755759726, now seen corresponding path program 1 times [2018-11-18 16:15:24,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:15:24,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:15:24,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:24,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:15:24,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:15:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:15:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:15:24,554 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 85 [2018-11-18 16:15:24,659 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:15:24,659 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:15:24,659 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:15:24,659 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:15:24,659 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:15:24,659 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:15:24,659 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:15:24,660 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:15:24,660 INFO L131 ssoRankerPreferences]: Filename of dumped script: sanfoundry_24_true-unreach-call_true-termination.i_Iteration6_Lasso [2018-11-18 16:15:24,660 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:15:24,660 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:15:24,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:15:24,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:15:24,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:15:24,669 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-18 16:15:24,670 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-18 16:15:24,672 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-18 16:15:24,673 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-18 16:15:24,675 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-18 16:15:24,677 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-18 16:15:24,735 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-18 16:15:24,737 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-18 16:15:24,738 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-18 16:15:24,888 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:15:24,888 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:15:24,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:15:24,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:24,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:15:24,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:24,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:24,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:15:24,891 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:15:24,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:15:24,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:15:24,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:24,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:15:24,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:15:24,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:24,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:24,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:15:24,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:15:24,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:15:24,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:15:24,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:24,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:15:24,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:15:24,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:24,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:24,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:15:24,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:15:24,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:15:24,896 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-18 16:15:24,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:24,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:15:24,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:15:24,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:24,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:24,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:15:24,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:15:24,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:15:24,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:15:24,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:24,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:15:24,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:24,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:24,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:15:24,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:15:24,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:15:24,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:15:24,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:24,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:15:24,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:15:24,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:24,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:24,902 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:15:24,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:15:24,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:15:24,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:15:24,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:24,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:15:24,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:15:24,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:24,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:24,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:15:24,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:15:24,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:15:24,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:15:24,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:24,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:15:24,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:24,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:24,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:15:24,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:15:24,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:15:24,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:15:24,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:24,907 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:15:24,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:24,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:24,908 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:15:24,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:15:24,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:15:24,910 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-18 16:15:24,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:15:24,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:15:24,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:15:24,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:15:24,912 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:15:24,912 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:15:24,920 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:15:24,938 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 16:15:24,938 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-18 16:15:24,938 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:15:24,940 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 16:15:24,940 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:15:24,940 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-18 16:15:24,961 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-18 16:15:24,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:15:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:15:24,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:15:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:15:24,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:15:24,998 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-18 16:15:24,998 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-18 16:15:24,998 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 25 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-18 16:15:25,004 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 25 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 27 states and 30 transitions. Complement of second has 6 states. [2018-11-18 16:15:25,005 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-18 16:15:25,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 16:15:25,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-18 16:15:25,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-18 16:15:25,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:15:25,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 4 letters. [2018-11-18 16:15:25,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:15:25,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 16 letters. Loop has 8 letters. [2018-11-18 16:15:25,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:15:25,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2018-11-18 16:15:25,007 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 16:15:25,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2018-11-18 16:15:25,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 16:15:25,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 16:15:25,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 16:15:25,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:15:25,007 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:15:25,007 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:15:25,007 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:15:25,007 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 16:15:25,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 16:15:25,008 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 16:15:25,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 16:15:25,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 04:15:25 BoogieIcfgContainer [2018-11-18 16:15:25,013 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 16:15:25,013 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:15:25,013 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:15:25,013 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:15:25,014 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:15:21" (3/4) ... [2018-11-18 16:15:25,016 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 16:15:25,016 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:15:25,017 INFO L168 Benchmark]: Toolchain (without parser) took 4106.98 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 326.1 MB). Free memory was 949.5 MB in the beginning and 1.3 GB in the end (delta: -361.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:15:25,017 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 974.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:15:25,018 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.19 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 937.7 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-18 16:15:25,018 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.86 ms. Allocated memory is still 1.0 GB. Free memory was 937.7 MB in the beginning and 935.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:15:25,019 INFO L168 Benchmark]: Boogie Preprocessor took 50.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 935.0 MB in the beginning and 1.2 GB in the end (delta: -215.3 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-11-18 16:15:25,021 INFO L168 Benchmark]: RCFGBuilder took 214.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-11-18 16:15:25,021 INFO L168 Benchmark]: BuchiAutomizer took 3660.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -187.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:15:25,022 INFO L168 Benchmark]: Witness Printer took 3.17 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2018-11-18 16:15:25,024 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 974.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 153.19 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 937.7 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.86 ms. Allocated memory is still 1.0 GB. Free memory was 937.7 MB in the beginning and 935.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 935.0 MB in the beginning and 1.2 GB in the end (delta: -215.3 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 214.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3660.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -187.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.17 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. 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 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.6s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 3.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 55 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 40 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 92 SDtfs, 145 SDslu, 185 SDs, 0 SdLazy, 151 SolverSat, 23 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: 8ms 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...