./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/java_AG313-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9be02c97-ca0e-4e35-b10d-a21cd3befcf6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9be02c97-ca0e-4e35-b10d-a21cd3befcf6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9be02c97-ca0e-4e35-b10d-a21cd3befcf6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9be02c97-ca0e-4e35-b10d-a21cd3befcf6/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/java_AG313-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9be02c97-ca0e-4e35-b10d-a21cd3befcf6/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9be02c97-ca0e-4e35-b10d-a21cd3befcf6/bin/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 64bit --witnessprinter.graph.data.programhash b64613d278f1b2a5aec6d84cb3470147257700f5 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:17:20,476 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:17:20,477 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:17:20,487 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:17:20,488 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:17:20,489 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:17:20,490 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:17:20,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:17:20,494 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:17:20,494 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:17:20,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:17:20,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:17:20,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:17:20,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:17:20,499 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:17:20,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:17:20,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:17:20,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:17:20,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:17:20,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:17:20,506 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:17:20,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:17:20,507 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:17:20,508 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:17:20,510 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:17:20,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:17:20,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:17:20,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:17:20,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:17:20,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:17:20,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:17:20,514 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:17:20,515 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:17:20,516 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:17:20,517 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:17:20,517 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:17:20,517 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:17:20,518 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:17:20,518 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:17:20,519 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:17:20,519 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:17:20,520 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9be02c97-ca0e-4e35-b10d-a21cd3befcf6/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 21:17:20,534 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:17:20,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:17:20,535 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:17:20,536 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:17:20,536 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:17:20,536 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:17:20,536 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:17:20,537 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:17:20,537 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:17:20,537 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:17:20,537 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:17:20,538 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:17:20,538 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:17:20,538 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:17:20,538 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:17:20,539 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:17:20,539 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:17:20,539 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:17:20,539 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:17:20,540 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:17:20,540 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:17:20,540 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:17:20,540 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:17:20,541 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:17:20,541 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:17:20,541 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:17:20,541 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:17:20,541 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:17:20,542 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:17:20,543 INFO L138 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/run_dir_9be02c97-ca0e-4e35-b10d-a21cd3befcf6/bin/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b64613d278f1b2a5aec6d84cb3470147257700f5 [2019-11-15 21:17:20,590 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:17:20,602 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:17:20,607 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:17:20,609 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:17:20,609 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:17:20,611 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9be02c97-ca0e-4e35-b10d-a21cd3befcf6/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/java_AG313-alloca.i [2019-11-15 21:17:20,665 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9be02c97-ca0e-4e35-b10d-a21cd3befcf6/bin/uautomizer/data/665d7da2d/6e4d458047f944568ba3ad1dbe26c0f8/FLAGdb827c095 [2019-11-15 21:17:21,128 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:17:21,128 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9be02c97-ca0e-4e35-b10d-a21cd3befcf6/sv-benchmarks/c/termination-memory-alloca/java_AG313-alloca.i [2019-11-15 21:17:21,141 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9be02c97-ca0e-4e35-b10d-a21cd3befcf6/bin/uautomizer/data/665d7da2d/6e4d458047f944568ba3ad1dbe26c0f8/FLAGdb827c095 [2019-11-15 21:17:21,453 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9be02c97-ca0e-4e35-b10d-a21cd3befcf6/bin/uautomizer/data/665d7da2d/6e4d458047f944568ba3ad1dbe26c0f8 [2019-11-15 21:17:21,456 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:17:21,457 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:17:21,457 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:17:21,457 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:17:21,460 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:17:21,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:17:21" (1/1) ... [2019-11-15 21:17:21,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fda6529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:17:21, skipping insertion in model container [2019-11-15 21:17:21,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:17:21" (1/1) ... [2019-11-15 21:17:21,469 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:17:21,503 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:17:21,860 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:17:21,869 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:17:21,921 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:17:21,968 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:17:21,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:17:21 WrapperNode [2019-11-15 21:17:21,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:17:21,969 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:17:21,969 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:17:21,969 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:17:21,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:17:21" (1/1) ... [2019-11-15 21:17:21,990 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:17:21" (1/1) ... [2019-11-15 21:17:22,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:17:22,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:17:22,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:17:22,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:17:22,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:17:21" (1/1) ... [2019-11-15 21:17:22,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:17:21" (1/1) ... [2019-11-15 21:17:22,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:17:21" (1/1) ... [2019-11-15 21:17:22,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:17:21" (1/1) ... [2019-11-15 21:17:22,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:17:21" (1/1) ... [2019-11-15 21:17:22,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:17:21" (1/1) ... [2019-11-15 21:17:22,031 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:17:21" (1/1) ... [2019-11-15 21:17:22,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:17:22,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:17:22,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:17:22,034 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:17:22,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:17:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9be02c97-ca0e-4e35-b10d-a21cd3befcf6/bin/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 [2019-11-15 21:17:22,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:17:22,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:17:22,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:17:22,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:17:22,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:17:22,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:17:22,346 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:17:22,346 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 21:17:22,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:17:22 BoogieIcfgContainer [2019-11-15 21:17:22,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:17:22,348 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:17:22,348 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:17:22,351 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:17:22,352 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:17:22,352 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:17:21" (1/3) ... [2019-11-15 21:17:22,353 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1847465a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:17:22, skipping insertion in model container [2019-11-15 21:17:22,353 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:17:22,354 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:17:21" (2/3) ... [2019-11-15 21:17:22,354 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1847465a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:17:22, skipping insertion in model container [2019-11-15 21:17:22,354 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:17:22,354 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:17:22" (3/3) ... [2019-11-15 21:17:22,356 INFO L371 chiAutomizerObserver]: Analyzing ICFG java_AG313-alloca.i [2019-11-15 21:17:22,396 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:17:22,396 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:17:22,397 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:17:22,397 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:17:22,397 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:17:22,397 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:17:22,397 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:17:22,397 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:17:22,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-15 21:17:22,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:17:22,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:17:22,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:17:22,435 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 21:17:22,436 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:17:22,436 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:17:22,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-15 21:17:22,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:17:22,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:17:22,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:17:22,437 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 21:17:22,438 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:17:22,443 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;quot_#in~x, quot_#in~y := main_#t~nondet13, main_#t~nondet14;havoc quot_#res;havoc quot_#t~malloc2.base, quot_#t~malloc2.offset, quot_#t~malloc3.base, quot_#t~malloc3.offset, quot_#t~malloc4.base, quot_#t~malloc4.offset, quot_#t~mem5, quot_#t~mem9, quot_#t~mem10, quot_#t~mem11, quot_#t~mem6, quot_#t~mem7, quot_#t~short8, quot_#t~mem12, quot_~x, quot_~y, quot_~x_ref~0.base, quot_~x_ref~0.offset, quot_~y_ref~0.base, quot_~y_ref~0.offset, quot_~i~0.base, quot_~i~0.offset;quot_~x := quot_#in~x;quot_~y := quot_#in~y;call quot_#t~malloc2.base, quot_#t~malloc2.offset := #Ultimate.allocOnStack(4);quot_~x_ref~0.base, quot_~x_ref~0.offset := quot_#t~malloc2.base, quot_#t~malloc2.offset;call quot_#t~malloc3.base, quot_#t~malloc3.offset := #Ultimate.allocOnStack(4);quot_~y_ref~0.base, quot_~y_ref~0.offset := quot_#t~malloc3.base, quot_#t~malloc3.offset;call quot_#t~malloc4.base, quot_#t~malloc4.offset := #Ultimate.allocOnStack(4);quot_~i~0.base, quot_~i~0.offset := quot_#t~malloc4.base, quot_#t~malloc4.offset;call write~int(quot_~x, quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);call write~int(quot_~y, quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);call write~int(0, quot_~i~0.base, quot_~i~0.offset, 4);call quot_#t~mem5 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4); 10#L555true assume !(0 == quot_#t~mem5);havoc quot_#t~mem5; 7#L556-5true [2019-11-15 21:17:22,443 INFO L793 eck$LassoCheckResult]: Loop: 7#L556-5true call quot_#t~mem6 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);quot_#t~short8 := quot_#t~mem6 > 0; 11#L556-1true assume !quot_#t~short8; 4#L556-3true assume !!quot_#t~short8;havoc quot_#t~mem6;havoc quot_#t~short8;havoc quot_#t~mem7;call quot_#t~mem9 := read~int(quot_~i~0.base, quot_~i~0.offset, 4);call write~int(1 + quot_#t~mem9, quot_~i~0.base, quot_~i~0.offset, 4);havoc quot_#t~mem9;call quot_#t~mem10 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);call quot_#t~mem11 := read~int(quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);call write~int(quot_#t~mem10 - 1 - (quot_#t~mem11 - 1), quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);havoc quot_#t~mem10;havoc quot_#t~mem11; 7#L556-5true [2019-11-15 21:17:22,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:17:22,448 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-11-15 21:17:22,453 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:17:22,453 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529111135] [2019-11-15 21:17:22,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:22,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:22,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:17:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:17:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:17:22,601 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:17:22,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:17:22,603 INFO L82 PathProgramCache]: Analyzing trace with hash 41873, now seen corresponding path program 1 times [2019-11-15 21:17:22,603 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:17:22,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096933459] [2019-11-15 21:17:22,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:22,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:22,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:17:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:22,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:17:22,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096933459] [2019-11-15 21:17:22,651 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:17:22,651 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:17:22,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093072667] [2019-11-15 21:17:22,655 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:17:22,655 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:17:22,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:17:22,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:17:22,671 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-11-15 21:17:22,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:17:22,705 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-11-15 21:17:22,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:17:22,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2019-11-15 21:17:22,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:17:22,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 6 states and 6 transitions. [2019-11-15 21:17:22,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 21:17:22,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 21:17:22,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 6 transitions. [2019-11-15 21:17:22,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:17:22,715 INFO L688 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-11-15 21:17:22,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 6 transitions. [2019-11-15 21:17:22,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-11-15 21:17:22,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 21:17:22,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-11-15 21:17:22,743 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-11-15 21:17:22,743 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-11-15 21:17:22,743 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:17:22,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 6 transitions. [2019-11-15 21:17:22,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:17:22,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:17:22,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:17:22,745 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 21:17:22,745 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:17:22,746 INFO L791 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 32#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;quot_#in~x, quot_#in~y := main_#t~nondet13, main_#t~nondet14;havoc quot_#res;havoc quot_#t~malloc2.base, quot_#t~malloc2.offset, quot_#t~malloc3.base, quot_#t~malloc3.offset, quot_#t~malloc4.base, quot_#t~malloc4.offset, quot_#t~mem5, quot_#t~mem9, quot_#t~mem10, quot_#t~mem11, quot_#t~mem6, quot_#t~mem7, quot_#t~short8, quot_#t~mem12, quot_~x, quot_~y, quot_~x_ref~0.base, quot_~x_ref~0.offset, quot_~y_ref~0.base, quot_~y_ref~0.offset, quot_~i~0.base, quot_~i~0.offset;quot_~x := quot_#in~x;quot_~y := quot_#in~y;call quot_#t~malloc2.base, quot_#t~malloc2.offset := #Ultimate.allocOnStack(4);quot_~x_ref~0.base, quot_~x_ref~0.offset := quot_#t~malloc2.base, quot_#t~malloc2.offset;call quot_#t~malloc3.base, quot_#t~malloc3.offset := #Ultimate.allocOnStack(4);quot_~y_ref~0.base, quot_~y_ref~0.offset := quot_#t~malloc3.base, quot_#t~malloc3.offset;call quot_#t~malloc4.base, quot_#t~malloc4.offset := #Ultimate.allocOnStack(4);quot_~i~0.base, quot_~i~0.offset := quot_#t~malloc4.base, quot_#t~malloc4.offset;call write~int(quot_~x, quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);call write~int(quot_~y, quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);call write~int(0, quot_~i~0.base, quot_~i~0.offset, 4);call quot_#t~mem5 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4); 33#L555 assume !(0 == quot_#t~mem5);havoc quot_#t~mem5; 35#L556-5 [2019-11-15 21:17:22,746 INFO L793 eck$LassoCheckResult]: Loop: 35#L556-5 call quot_#t~mem6 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);quot_#t~short8 := quot_#t~mem6 > 0; 37#L556-1 assume quot_#t~short8;call quot_#t~mem7 := read~int(quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);quot_#t~short8 := quot_#t~mem7 > 0; 34#L556-3 assume !!quot_#t~short8;havoc quot_#t~mem6;havoc quot_#t~short8;havoc quot_#t~mem7;call quot_#t~mem9 := read~int(quot_~i~0.base, quot_~i~0.offset, 4);call write~int(1 + quot_#t~mem9, quot_~i~0.base, quot_~i~0.offset, 4);havoc quot_#t~mem9;call quot_#t~mem10 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);call quot_#t~mem11 := read~int(quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);call write~int(quot_#t~mem10 - 1 - (quot_#t~mem11 - 1), quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);havoc quot_#t~mem10;havoc quot_#t~mem11; 35#L556-5 [2019-11-15 21:17:22,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:17:22,746 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2019-11-15 21:17:22,747 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:17:22,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088109963] [2019-11-15 21:17:22,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:22,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:22,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:17:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:17:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:17:22,815 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:17:22,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:17:22,816 INFO L82 PathProgramCache]: Analyzing trace with hash 41811, now seen corresponding path program 1 times [2019-11-15 21:17:22,816 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:17:22,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382430792] [2019-11-15 21:17:22,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:22,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:22,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:17:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:17:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:17:22,843 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:17:22,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:17:22,843 INFO L82 PathProgramCache]: Analyzing trace with hash 889571280, now seen corresponding path program 1 times [2019-11-15 21:17:22,844 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:17:22,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53732930] [2019-11-15 21:17:22,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:22,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:17:22,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:17:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:17:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:17:22,907 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:17:23,111 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-11-15 21:17:23,670 WARN L191 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 94 [2019-11-15 21:17:23,872 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-15 21:17:23,884 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:17:23,885 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:17:23,885 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:17:23,886 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:17:23,886 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:17:23,886 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:17:23,886 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:17:23,886 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:17:23,887 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_AG313-alloca.i_Iteration2_Lasso [2019-11-15 21:17:23,887 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:17:23,887 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:17: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 [2019-11-15 21:17:23,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:17:23,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:17:23,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:17:23,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:17:23,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:17:23,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:17:23,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:17:23,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:17:23,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:17:23,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:17:23,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:17:23,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:17:23,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:17:23,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:17:24,428 WARN L191 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-11-15 21:17:24,629 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-11-15 21:17:24,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:17:24,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:17:24,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:17:24,900 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-11-15 21:17:25,454 WARN L191 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-15 21:17:25,648 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:17:25,653 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:17:25,655 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:17:25,657 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:17:25,657 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:17:25,658 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:17:25,658 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:17:25,658 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:17:25,660 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:17:25,660 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:17:25,662 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:17:25,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:17:25,663 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:17:25,663 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:17:25,663 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:17:25,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:17:25,664 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:17:25,664 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:17:25,664 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:17:25,665 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:17:25,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:17:25,666 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:17:25,666 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:17:25,667 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:17:25,667 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:17:25,669 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:17:25,669 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:17:25,672 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:17:25,673 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:17:25,673 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:17:25,674 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:17:25,674 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:17:25,674 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:17:25,674 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:17:25,675 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:17:25,675 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:17:25,676 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:17:25,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:17:25,677 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:17:25,677 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:17:25,677 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:17:25,677 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:17:25,678 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:17:25,678 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:17:25,678 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:17:25,679 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:17:25,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:17:25,680 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:17:25,680 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:17:25,680 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:17:25,681 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:17:25,682 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:17:25,682 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:17:25,687 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:17:25,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:17:25,688 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:17:25,688 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:17:25,688 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:17:25,688 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:17:25,688 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:17:25,689 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:17:25,689 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:17:25,690 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:17:25,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:17:25,691 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:17:25,691 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:17:25,691 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:17:25,692 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:17:25,692 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:17:25,692 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:17:25,692 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:17:25,693 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:17:25,694 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:17:25,694 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:17:25,694 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:17:25,695 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:17:25,695 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:17:25,696 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:17:25,697 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:17:25,699 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:17:25,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:17:25,700 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:17:25,700 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:17:25,700 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:17:25,701 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:17:25,702 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:17:25,702 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:17:25,704 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:17:25,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:17:25,706 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:17:25,706 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:17:25,706 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:17:25,706 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:17:25,708 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:17:25,708 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:17:25,710 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:17:25,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:17:25,711 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:17:25,711 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:17:25,712 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:17:25,712 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:17:25,712 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:17:25,712 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:17:25,713 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:17:25,713 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:17:25,714 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:17:25,714 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:17:25,715 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:17:25,715 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:17:25,715 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:17:25,715 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:17:25,716 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:17:25,716 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:17:25,717 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:17:25,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:17:25,718 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:17:25,718 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:17:25,718 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:17:25,718 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:17:25,718 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:17:25,719 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:17:25,719 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:17:25,720 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:17:25,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:17:25,721 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:17:25,721 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:17:25,721 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:17:25,721 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:17:25,723 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:17:25,724 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:17:25,733 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:17:25,733 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:17:25,734 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:17:25,734 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:17:25,734 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:17:25,735 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:17:25,737 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:17:25,737 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:17:25,746 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:17:25,746 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:17:25,747 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:17:25,747 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-15 21:17:25,747 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:17:25,748 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:17:25,756 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-15 21:17:25,756 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:17:25,813 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:17:25,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:17:25,815 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:17:25,815 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:17:25,818 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:17:25,819 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:17:25,820 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:17:25,820 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:17:25,822 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:17:25,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:17:25,826 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:17:25,827 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:17:25,827 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:17:25,827 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:17:25,831 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:17:25,834 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:17:25,886 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:17:25,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:17:25,891 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:17:25,892 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:17:25,892 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:17:25,892 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:17:25,894 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:17:25,894 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:17:25,908 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:17:25,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:17:25,910 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:17:25,910 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:17:25,910 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:17:25,910 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:17:25,915 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:17:25,915 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:17:25,923 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:17:25,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:17:25,924 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:17:25,925 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 21:17:25,925 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:17:25,926 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:17:25,928 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 21:17:25,929 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:17:25,977 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:17:26,000 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:17:26,000 INFO L444 ModelExtractionUtils]: 25 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 21:17:26,002 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:17:26,003 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:17:26,004 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:17:26,004 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)_1 Supporting invariants [] [2019-11-15 21:17:26,094 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-11-15 21:17:26,103 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 21:17:26,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:17:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:26,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 21:17:26,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:17:26,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 21:17:26,314 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 27 [2019-11-15 21:17:26,314 INFO L567 ElimStorePlain]: treesize reduction 86, result has 32.3 percent of original size [2019-11-15 21:17:26,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:17:26,316 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:68, output treesize:17 [2019-11-15 21:17:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:17:26,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 21:17:26,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:17:26,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:17:26,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:17:26,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:17:26,490 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 21:17:26,491 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1 Second operand 5 states. [2019-11-15 21:17:26,579 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1. Second operand 5 states. Result 9 states and 10 transitions. Complement of second has 7 states. [2019-11-15 21:17:26,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 21:17:26,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 21:17:26,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2019-11-15 21:17:26,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 3 letters. Loop has 3 letters. [2019-11-15 21:17:26,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:17:26,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-15 21:17:26,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:17:26,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 3 letters. Loop has 6 letters. [2019-11-15 21:17:26,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:17:26,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-11-15 21:17:26,585 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:17:26,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2019-11-15 21:17:26,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 21:17:26,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 21:17:26,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 21:17:26,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:17:26,586 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:17:26,586 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:17:26,586 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:17:26,586 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:17:26,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:17:26,586 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:17:26,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 21:17:26,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:17:26 BoogieIcfgContainer [2019-11-15 21:17:26,597 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:17:26,598 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:17:26,598 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:17:26,598 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:17:26,598 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:17:22" (3/4) ... [2019-11-15 21:17:26,603 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 21:17:26,603 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:17:26,605 INFO L168 Benchmark]: Toolchain (without parser) took 5148.08 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 230.7 MB). Free memory was 939.4 MB in the beginning and 1.2 GB in the end (delta: -264.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:17:26,606 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:17:26,607 INFO L168 Benchmark]: CACSL2BoogieTranslator took 511.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.2 MB). Free memory was 939.4 MB in the beginning and 1.2 GB in the end (delta: -230.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:17:26,607 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:17:26,608 INFO L168 Benchmark]: Boogie Preprocessor took 24.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:17:26,609 INFO L168 Benchmark]: RCFGBuilder took 313.67 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:17:26,610 INFO L168 Benchmark]: BuchiAutomizer took 4249.37 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 43.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -56.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:17:26,611 INFO L168 Benchmark]: Witness Printer took 5.85 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:17:26,619 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 511.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.2 MB). Free memory was 939.4 MB in the beginning and 1.2 GB in the end (delta: -230.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 313.67 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4249.37 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 43.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -56.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 5.85 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 6 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 14 SDtfs, 1 SDslu, 8 SDs, 0 SdLazy, 13 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital347 mio100 ax105 hnf100 lsp92 ukn57 mio100 lsp37 div100 bol100 ite100 ukn100 eq182 hnf88 smp94 dnf303 smp92 tf100 neg92 sie126 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 67ms VariablesStem: 7 VariablesLoop: 6 DisjunctsStem: 8 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 20 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...