./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/cstrncat-alloca-1.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_c3657d76-c95d-48d4-a592-7660d66b6028/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c3657d76-c95d-48d4-a592-7660d66b6028/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c3657d76-c95d-48d4-a592-7660d66b6028/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c3657d76-c95d-48d4-a592-7660d66b6028/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/cstrncat-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c3657d76-c95d-48d4-a592-7660d66b6028/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c3657d76-c95d-48d4-a592-7660d66b6028/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 0131b237d1353fa18fec727a7424c78c2056aaff ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 22:18:57,020 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:18:57,022 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:18:57,036 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:18:57,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:18:57,038 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:18:57,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:18:57,051 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:18:57,056 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:18:57,059 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:18:57,061 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:18:57,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:18:57,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:18:57,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:18:57,068 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:18:57,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:18:57,070 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:18:57,072 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:18:57,075 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:18:57,079 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:18:57,082 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:18:57,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:18:57,087 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:18:57,087 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:18:57,091 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:18:57,091 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:18:57,091 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:18:57,093 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:18:57,094 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:18:57,094 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:18:57,095 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:18:57,095 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:18:57,096 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:18:57,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:18:57,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:18:57,099 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:18:57,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:18:57,100 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:18:57,100 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:18:57,101 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:18:57,101 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:18:57,103 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c3657d76-c95d-48d4-a592-7660d66b6028/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 22:18:57,132 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:18:57,141 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:18:57,142 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:18:57,143 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:18:57,143 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:18:57,143 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:18:57,144 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:18:57,144 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:18:57,145 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:18:57,145 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:18:57,145 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:18:57,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:18:57,147 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:18:57,148 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:18:57,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:18:57,148 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:18:57,148 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:18:57,149 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:18:57,149 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:18:57,149 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:18:57,149 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:18:57,149 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:18:57,150 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:18:57,150 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:18:57,150 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:18:57,150 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:18:57,151 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:18:57,151 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:18:57,152 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:18:57,152 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_c3657d76-c95d-48d4-a592-7660d66b6028/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 -> 0131b237d1353fa18fec727a7424c78c2056aaff [2019-11-15 22:18:57,178 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:18:57,188 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:18:57,191 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:18:57,193 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:18:57,193 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:18:57,194 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c3657d76-c95d-48d4-a592-7660d66b6028/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/cstrncat-alloca-1.i [2019-11-15 22:18:57,252 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c3657d76-c95d-48d4-a592-7660d66b6028/bin/uautomizer/data/ebb34042a/d443c9f1bc5c447880c54788a27b4d49/FLAGfcf65f7f0 [2019-11-15 22:18:57,721 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:18:57,722 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c3657d76-c95d-48d4-a592-7660d66b6028/sv-benchmarks/c/termination-memory-alloca/cstrncat-alloca-1.i [2019-11-15 22:18:57,738 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c3657d76-c95d-48d4-a592-7660d66b6028/bin/uautomizer/data/ebb34042a/d443c9f1bc5c447880c54788a27b4d49/FLAGfcf65f7f0 [2019-11-15 22:18:58,052 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c3657d76-c95d-48d4-a592-7660d66b6028/bin/uautomizer/data/ebb34042a/d443c9f1bc5c447880c54788a27b4d49 [2019-11-15 22:18:58,056 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:18:58,058 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:18:58,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:18:58,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:18:58,067 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:18:58,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:18:58" (1/1) ... [2019-11-15 22:18:58,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b053f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:58, skipping insertion in model container [2019-11-15 22:18:58,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:18:58" (1/1) ... [2019-11-15 22:18:58,080 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:18:58,142 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:18:58,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:18:58,690 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:18:58,768 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:18:58,832 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:18:58,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:58 WrapperNode [2019-11-15 22:18:58,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:18:58,833 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:18:58,833 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:18:58,834 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:18:58,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:58" (1/1) ... [2019-11-15 22:18:58,871 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:58" (1/1) ... [2019-11-15 22:18:58,902 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:18:58,903 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:18:58,903 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:18:58,903 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:18:58,914 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:58" (1/1) ... [2019-11-15 22:18:58,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:58" (1/1) ... [2019-11-15 22:18:58,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:58" (1/1) ... [2019-11-15 22:18:58,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:58" (1/1) ... [2019-11-15 22:18:58,945 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:58" (1/1) ... [2019-11-15 22:18:58,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:58" (1/1) ... [2019-11-15 22:18:58,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:58" (1/1) ... [2019-11-15 22:18:58,968 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:18:58,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:18:58,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:18:58,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:18:58,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3657d76-c95d-48d4-a592-7660d66b6028/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 22:18:59,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:18:59,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:18:59,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:18:59,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:18:59,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:18:59,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:18:59,447 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:18:59,447 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 22:18:59,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:18:59 BoogieIcfgContainer [2019-11-15 22:18:59,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:18:59,449 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:18:59,449 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:18:59,453 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:18:59,454 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:18:59,454 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:18:58" (1/3) ... [2019-11-15 22:18:59,455 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1400e1bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:18:59, skipping insertion in model container [2019-11-15 22:18:59,456 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:18:59,456 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:18:58" (2/3) ... [2019-11-15 22:18:59,456 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1400e1bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:18:59, skipping insertion in model container [2019-11-15 22:18:59,456 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:18:59,457 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:18:59" (3/3) ... [2019-11-15 22:18:59,458 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrncat-alloca-1.i [2019-11-15 22:18:59,510 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:18:59,510 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:18:59,510 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:18:59,511 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:18:59,511 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:18:59,511 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:18:59,511 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:18:59,511 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:18:59,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 22:18:59,551 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 22:18:59,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:18:59,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:18:59,559 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:18:59,559 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:18:59,559 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:18:59,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 22:18:59,561 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 22:18:59,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:18:59,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:18:59,562 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:18:59,562 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:18:59,572 INFO L791 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~n~0 := main_#t~nondet12;havoc main_#t~nondet12; 13#L564true assume !(main_~length1~0 < 1); 16#L564-2true assume !(main_~length2~0 < 1); 10#L567-1true assume !(main_~n~0 < 1); 4#L570-1true assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post3.base, cstrncat_#t~post3.offset, cstrncat_#t~mem2, cstrncat_#t~post7, cstrncat_#t~post8.base, cstrncat_#t~post8.offset, cstrncat_#t~post4.base, cstrncat_#t~post4.offset, cstrncat_#t~mem5, cstrncat_#t~short6, cstrncat_#t~mem9, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 7#L550-3true [2019-11-15 22:18:59,572 INFO L793 eck$LassoCheckResult]: Loop: 7#L550-3true call cstrncat_#t~mem2 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 20#L550-1true assume !!(0 != cstrncat_#t~mem2);havoc cstrncat_#t~mem2;cstrncat_#t~post3.base, cstrncat_#t~post3.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post3.base, 1 + cstrncat_#t~post3.offset;havoc cstrncat_#t~post3.base, cstrncat_#t~post3.offset; 7#L550-3true [2019-11-15 22:18:59,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:18:59,579 INFO L82 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2019-11-15 22:18:59,588 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:18:59,589 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646376824] [2019-11-15 22:18:59,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:18:59,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:18:59,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:18:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:18:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:18:59,780 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:18:59,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:18:59,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2019-11-15 22:18:59,782 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:18:59,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434977275] [2019-11-15 22:18:59,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:18:59,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:18:59,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:18:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:18:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:18:59,798 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:18:59,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:18:59,800 INFO L82 PathProgramCache]: Analyzing trace with hash 180553748, now seen corresponding path program 1 times [2019-11-15 22:18:59,801 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:18:59,801 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120417997] [2019-11-15 22:18:59,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:18:59,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:18:59,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:18:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:18:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:18:59,858 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:19:00,742 WARN L191 SmtUtils]: Spent 754.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 98 [2019-11-15 22:19:00,958 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-15 22:19:00,973 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:19:00,974 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:19:00,974 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:19:00,974 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:19:00,975 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:19:00,975 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:19:00,975 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:19:00,975 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:19:00,976 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncat-alloca-1.i_Iteration1_Lasso [2019-11-15 22:19:00,976 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:19:00,976 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:19:01,019 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 22:19:01,032 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 22:19:01,039 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 22:19:01,043 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 22:19:01,047 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 22:19:01,054 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 22:19:01,057 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 22:19:01,062 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 22:19:01,072 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 22:19:01,078 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 22:19:01,082 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 22:19:01,086 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 22:19:01,089 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 22:19:01,095 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 22:19:01,099 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 22:19:01,105 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 22:19:01,108 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 22:19:01,111 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 22:19:01,116 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 22:19:01,119 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 22:19:01,122 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 22:19:01,641 WARN L191 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-11-15 22:19:01,738 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 22:19:01,741 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 22:19:01,744 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 22:19:01,748 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 22:19:02,693 WARN L191 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-15 22:19:02,913 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:19:02,919 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:19:02,922 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 22:19:02,933 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:19:02,934 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:19:02,935 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:19:02,935 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:19:02,935 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:19:02,938 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:19:02,939 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:19:02,942 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:19:02,943 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 22:19:02,944 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:19:02,944 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:19:02,944 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:19:02,944 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:19:02,951 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:19:02,952 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:19:02,963 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:19:02,967 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 22:19:02,968 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:19:02,969 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:19:02,970 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:19:02,970 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:19:02,970 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:19:02,972 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:19:02,973 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:19:02,973 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:19:02,974 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 22:19:02,975 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:19:02,975 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:19:02,976 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:19:02,976 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:19:02,979 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:19:02,979 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:19:02,983 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:19:02,984 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 22:19:02,984 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:19:02,985 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:19:02,985 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:19:02,985 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:19:02,985 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:19:02,986 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:19:02,986 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:19:02,987 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:19:02,987 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 22:19:02,988 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:19:02,988 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:19:02,988 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:19:02,988 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:19:02,988 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:19:02,989 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:19:02,989 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:19:02,990 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:19:02,990 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 22:19:02,991 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:19:02,991 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:19:02,991 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:19:02,991 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:19:02,991 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:19:02,992 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:19:02,992 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:19:02,993 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:19:02,993 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 22:19:02,994 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:19:02,994 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:19:02,994 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:19:02,994 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:19:02,996 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:19:02,996 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:19:02,999 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:19:03,000 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 22:19:03,000 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:19:03,000 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:19:03,001 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:19:03,001 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:19:03,001 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:19:03,001 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:19:03,002 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:19:03,002 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:19:03,003 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 22:19:03,004 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:19:03,004 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:19:03,004 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:19:03,004 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:19:03,004 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:19:03,005 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:19:03,005 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:19:03,006 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:19:03,006 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 22:19:03,007 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:19:03,007 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:19:03,007 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:19:03,008 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:19:03,008 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:19:03,008 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:19:03,008 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:19:03,009 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:19:03,010 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 22:19:03,011 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:19:03,011 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:19:03,011 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:19:03,011 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:19:03,011 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:19:03,012 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:19:03,012 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:19:03,013 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:19:03,013 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 22:19:03,014 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:19:03,014 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:19:03,014 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:19:03,015 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:19:03,015 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:19:03,015 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:19:03,015 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:19:03,016 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:19:03,017 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 22:19:03,017 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:19:03,018 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:19:03,018 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:19:03,018 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:19:03,018 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:19:03,019 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:19:03,019 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:19:03,020 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:19:03,020 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 22:19:03,021 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:19:03,021 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:19:03,021 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:19:03,021 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:19:03,022 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:19:03,022 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:19:03,022 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:19:03,023 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:19:03,024 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 22:19:03,024 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:19:03,024 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:19:03,025 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:19:03,025 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:19:03,025 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:19:03,026 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:19:03,026 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:19:03,027 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:19:03,027 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 22:19:03,028 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:19:03,028 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:19:03,028 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:19:03,029 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:19:03,029 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:19:03,029 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:19:03,029 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:19:03,030 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:19:03,031 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 22:19:03,031 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:19:03,032 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:19:03,032 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:19:03,032 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:19:03,034 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:19:03,034 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:19:03,037 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:19:03,038 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 22:19:03,038 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:19:03,038 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:19:03,039 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:19:03,039 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:19:03,039 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:19:03,039 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:19:03,040 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:19:03,041 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:19:03,041 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 22:19:03,042 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:19:03,042 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:19:03,042 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:19:03,042 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:19:03,042 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:19:03,043 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:19:03,043 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:19:03,044 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:19:03,044 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 22:19:03,045 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:19:03,045 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 22:19:03,045 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:19:03,046 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:19:03,056 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 22:19:03,057 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:19:03,144 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:19:03,144 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 22:19:03,145 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:19:03,146 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:19:03,146 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:19:03,146 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:19:03,148 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:19:03,148 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:19:03,160 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:19:03,161 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 22:19:03,162 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:19:03,162 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:19:03,162 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:19:03,162 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:19:03,163 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:19:03,164 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:19:03,166 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:19:03,167 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 22:19:03,167 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:19:03,167 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:19:03,168 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:19:03,168 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:19:03,169 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:19:03,169 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:19:03,173 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:19:03,173 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 22:19:03,174 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:19:03,174 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:19:03,174 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:19:03,175 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:19:03,176 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:19:03,176 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:19:03,178 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:19:03,179 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 22:19:03,180 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:19:03,180 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:19:03,180 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:19:03,180 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:19:03,182 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:19:03,182 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:19:03,187 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:19:03,187 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 22:19:03,188 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:19:03,188 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:19:03,188 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:19:03,188 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:19:03,189 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:19:03,190 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:19:03,192 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:19:03,192 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 22:19:03,193 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:19:03,193 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:19:03,193 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:19:03,193 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 22:19:03,194 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:19:03,194 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 22:19:03,194 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:19:03,197 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:19:03,198 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 22:19:03,198 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:19:03,199 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:19:03,199 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:19:03,199 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:19:03,204 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:19:03,204 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:19:03,255 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:19:03,348 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 22:19:03,350 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 22:19:03,354 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:19:03,355 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:19:03,356 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:19:03,357 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrncat_~s~0.base)_1, ULTIMATE.start_cstrncat_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrncat_~s~0.base)_1 - 1*ULTIMATE.start_cstrncat_~s~0.offset Supporting invariants [] [2019-11-15 22:19:03,390 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-15 22:19:03,401 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 22:19:03,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:03,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:19:03,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:19:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:03,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:19:03,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:19:03,521 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 22:19:03,541 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:19:03,543 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2019-11-15 22:19:03,640 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 53 states and 76 transitions. Complement of second has 7 states. [2019-11-15 22:19:03,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:19:03,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:19:03,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2019-11-15 22:19:03,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-15 22:19:03,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:19:03,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-15 22:19:03,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:19:03,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-15 22:19:03,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:19:03,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 76 transitions. [2019-11-15 22:19:03,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:19:03,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 20 states and 27 transitions. [2019-11-15 22:19:03,671 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 22:19:03,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 22:19:03,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2019-11-15 22:19:03,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:19:03,673 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-15 22:19:03,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2019-11-15 22:19:03,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-11-15 22:19:03,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 22:19:03,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-11-15 22:19:03,708 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-15 22:19:03,708 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-15 22:19:03,708 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:19:03,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2019-11-15 22:19:03,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:19:03,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:19:03,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:19:03,710 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:19:03,710 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:19:03,711 INFO L791 eck$LassoCheckResult]: Stem: 169#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 164#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15.base, main_#t~ret15.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~n~0 := main_#t~nondet12;havoc main_#t~nondet12; 158#L564 assume !(main_~length1~0 < 1); 159#L564-2 assume !(main_~length2~0 < 1); 172#L567-1 assume !(main_~n~0 < 1); 165#L570-1 assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post3.base, cstrncat_#t~post3.offset, cstrncat_#t~mem2, cstrncat_#t~post7, cstrncat_#t~post8.base, cstrncat_#t~post8.offset, cstrncat_#t~post4.base, cstrncat_#t~post4.offset, cstrncat_#t~mem5, cstrncat_#t~short6, cstrncat_#t~mem9, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 166#L550-3 call cstrncat_#t~mem2 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 167#L550-1 assume !(0 != cstrncat_#t~mem2);havoc cstrncat_#t~mem2; 162#L552-4 cstrncat_#t~short6 := 0 != cstrncat_~n; 163#L552 assume !cstrncat_#t~short6; 171#L552-2 assume !!cstrncat_#t~short6;havoc cstrncat_#t~short6;havoc cstrncat_#t~mem5;havoc cstrncat_#t~post4.base, cstrncat_#t~post4.offset;cstrncat_#t~post7 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post7 - 1;havoc cstrncat_#t~post7;cstrncat_#t~post8.base, cstrncat_#t~post8.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post8.base, 1 + cstrncat_#t~post8.offset;havoc cstrncat_#t~post8.base, cstrncat_#t~post8.offset; 175#L552-4 cstrncat_#t~short6 := 0 != cstrncat_~n; 161#L552 [2019-11-15 22:19:03,711 INFO L793 eck$LassoCheckResult]: Loop: 161#L552 assume !cstrncat_#t~short6; 170#L552-2 assume !!cstrncat_#t~short6;havoc cstrncat_#t~short6;havoc cstrncat_#t~mem5;havoc cstrncat_#t~post4.base, cstrncat_#t~post4.offset;cstrncat_#t~post7 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post7 - 1;havoc cstrncat_#t~post7;cstrncat_#t~post8.base, cstrncat_#t~post8.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post8.base, 1 + cstrncat_#t~post8.offset;havoc cstrncat_#t~post8.base, cstrncat_#t~post8.offset; 160#L552-4 cstrncat_#t~short6 := 0 != cstrncat_~n; 161#L552 [2019-11-15 22:19:03,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:03,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1662025132, now seen corresponding path program 1 times [2019-11-15 22:19:03,711 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:03,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893052749] [2019-11-15 22:19:03,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:03,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:03,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:03,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:19:03,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893052749] [2019-11-15 22:19:03,792 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:19:03,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:19:03,793 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092197065] [2019-11-15 22:19:03,795 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:19:03,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:19:03,796 INFO L82 PathProgramCache]: Analyzing trace with hash 76643, now seen corresponding path program 1 times [2019-11-15 22:19:03,796 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:19:03,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574976394] [2019-11-15 22:19:03,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:03,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:19:03,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:19:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:19:03,807 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 22:19:03,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574976394] [2019-11-15 22:19:03,807 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:19:03,807 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:19:03,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810292809] [2019-11-15 22:19:03,808 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 22:19:03,808 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:19:03,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:19:03,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:19:03,812 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-15 22:19:03,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:19:03,828 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-11-15 22:19:03,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:19:03,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2019-11-15 22:19:03,831 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:19:03,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2019-11-15 22:19:03,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:19:03,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:19:03,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:19:03,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:19:03,832 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:19:03,832 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:19:03,832 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:19:03,832 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:19:03,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:19:03,832 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:19:03,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:19:03,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:19:03 BoogieIcfgContainer [2019-11-15 22:19:03,840 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:19:03,841 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:19:03,841 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:19:03,841 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:19:03,842 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:18:59" (3/4) ... [2019-11-15 22:19:03,846 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:19:03,846 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:19:03,848 INFO L168 Benchmark]: Toolchain (without parser) took 5789.93 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 240.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -157.5 MB). Peak memory consumption was 82.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:19:03,849 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:19:03,850 INFO L168 Benchmark]: CACSL2BoogieTranslator took 770.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.6 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -218.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:19:03,850 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.36 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 22:19:03,851 INFO L168 Benchmark]: Boogie Preprocessor took 77.04 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 22:19:03,851 INFO L168 Benchmark]: RCFGBuilder took 468.54 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: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:19:03,852 INFO L168 Benchmark]: BuchiAutomizer took 4391.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 54.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.1 MB). Peak memory consumption was 88.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:19:03,853 INFO L168 Benchmark]: Witness Printer took 5.38 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:19:03,857 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 770.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.6 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -218.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.36 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 77.04 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. * RCFGBuilder took 468.54 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: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4391.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 54.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.1 MB). Peak memory consumption was 88.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.38 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 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 #length * 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-#length-unknown[s] + -1 * s 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.3s and 3 iterations. TraceHistogramMax:2. Analysis of lassos took 3.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 37 SDtfs, 26 SDslu, 23 SDs, 0 SdLazy, 16 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital203 mio100 ax108 hnf98 lsp88 ukn76 mio100 lsp41 div100 bol100 ite100 ukn100 eq187 hnf88 smp100 dnf240 smp97 tf100 neg96 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 99ms VariablesStem: 10 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...