./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/cstrchr-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8d030412-2df0-484c-a594-ec234f630c1c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8d030412-2df0-484c-a594-ec234f630c1c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8d030412-2df0-484c-a594-ec234f630c1c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8d030412-2df0-484c-a594-ec234f630c1c/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/cstrchr-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8d030412-2df0-484c-a594-ec234f630c1c/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8d030412-2df0-484c-a594-ec234f630c1c/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5bb49c482aaa1a2241193483b61f4d87bfc9c366 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:56:36,078 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:56:36,079 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:56:36,085 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:56:36,085 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:56:36,086 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:56:36,087 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:56:36,088 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:56:36,090 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:56:36,090 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:56:36,091 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:56:36,091 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:56:36,092 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:56:36,092 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:56:36,093 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:56:36,094 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:56:36,094 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:56:36,096 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:56:36,097 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:56:36,099 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:56:36,099 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:56:36,100 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:56:36,102 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:56:36,102 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:56:36,102 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:56:36,103 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:56:36,104 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:56:36,105 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:56:36,105 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:56:36,106 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:56:36,106 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:56:36,107 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:56:36,107 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:56:36,107 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:56:36,108 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:56:36,108 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:56:36,109 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8d030412-2df0-484c-a594-ec234f630c1c/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 07:56:36,120 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:56:36,120 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:56:36,121 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:56:36,121 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:56:36,121 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:56:36,122 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 07:56:36,122 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 07:56:36,122 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 07:56:36,122 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 07:56:36,122 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 07:56:36,122 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 07:56:36,122 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:56:36,123 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 07:56:36,123 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:56:36,123 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:56:36,123 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 07:56:36,123 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 07:56:36,123 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 07:56:36,123 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:56:36,124 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 07:56:36,124 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 07:56:36,124 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:56:36,124 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:56:36,124 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 07:56:36,124 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:56:36,124 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:56:36,125 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 07:56:36,125 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 07:56:36,126 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_8d030412-2df0-484c-a594-ec234f630c1c/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5bb49c482aaa1a2241193483b61f4d87bfc9c366 [2018-11-10 07:56:36,149 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:56:36,158 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:56:36,161 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:56:36,162 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:56:36,162 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:56:36,163 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8d030412-2df0-484c-a594-ec234f630c1c/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/cstrchr-alloca_true-termination.c.i [2018-11-10 07:56:36,207 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8d030412-2df0-484c-a594-ec234f630c1c/bin-2019/uautomizer/data/e7c20ddc5/27f896bd3d4e4f8cb7f590f58e7be27e/FLAGa39e22d90 [2018-11-10 07:56:36,538 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:56:36,539 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8d030412-2df0-484c-a594-ec234f630c1c/sv-benchmarks/c/termination-memory-alloca/cstrchr-alloca_true-termination.c.i [2018-11-10 07:56:36,547 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8d030412-2df0-484c-a594-ec234f630c1c/bin-2019/uautomizer/data/e7c20ddc5/27f896bd3d4e4f8cb7f590f58e7be27e/FLAGa39e22d90 [2018-11-10 07:56:36,559 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8d030412-2df0-484c-a594-ec234f630c1c/bin-2019/uautomizer/data/e7c20ddc5/27f896bd3d4e4f8cb7f590f58e7be27e [2018-11-10 07:56:36,562 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:56:36,563 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:56:36,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:56:36,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:56:36,567 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:56:36,568 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:56:36" (1/1) ... [2018-11-10 07:56:36,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@283e34ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:36, skipping insertion in model container [2018-11-10 07:56:36,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:56:36" (1/1) ... [2018-11-10 07:56:36,579 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:56:36,608 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:56:36,802 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:56:36,808 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:56:36,836 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:56:36,861 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:56:36,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:36 WrapperNode [2018-11-10 07:56:36,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:56:36,862 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:56:36,862 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:56:36,862 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:56:36,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:36" (1/1) ... [2018-11-10 07:56:36,919 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:36" (1/1) ... [2018-11-10 07:56:36,932 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:56:36,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:56:36,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:56:36,932 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:56:36,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:36" (1/1) ... [2018-11-10 07:56:36,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:36" (1/1) ... [2018-11-10 07:56:36,939 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:36" (1/1) ... [2018-11-10 07:56:36,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:36" (1/1) ... [2018-11-10 07:56:36,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:36" (1/1) ... [2018-11-10 07:56:36,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:36" (1/1) ... [2018-11-10 07:56:36,947 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:36" (1/1) ... [2018-11-10 07:56:36,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:56:36,949 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:56:36,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:56:36,950 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:56:36,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8d030412-2df0-484c-a594-ec234f630c1c/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:56:36,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 07:56:36,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 07:56:36,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:56:36,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:56:37,130 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:56:37,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:56:37 BoogieIcfgContainer [2018-11-10 07:56:37,130 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:56:37,131 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 07:56:37,131 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 07:56:37,134 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 07:56:37,135 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:56:37,135 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 07:56:36" (1/3) ... [2018-11-10 07:56:37,136 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b83ecd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:56:37, skipping insertion in model container [2018-11-10 07:56:37,136 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:56:37,136 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:36" (2/3) ... [2018-11-10 07:56:37,141 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b83ecd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:56:37, skipping insertion in model container [2018-11-10 07:56:37,141 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:56:37,141 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:56:37" (3/3) ... [2018-11-10 07:56:37,143 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrchr-alloca_true-termination.c.i [2018-11-10 07:56:37,176 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:56:37,176 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 07:56:37,177 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 07:56:37,177 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 07:56:37,177 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:56:37,177 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:56:37,177 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 07:56:37,177 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:56:37,177 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 07:56:37,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-10 07:56:37,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 07:56:37,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:56:37,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:56:37,207 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:56:37,207 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 07:56:37,207 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 07:56:37,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-10 07:56:37,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 07:56:37,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:56:37,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:56:37,209 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:56:37,209 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 07:56:37,216 INFO L793 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~ret11.base, main_#t~ret11.offset, main_~length~0, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8; 9#L555true assume !(main_~length~0 < 1); 12#L555-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 22#L559true SUMMARY for call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L559 5#L559-1true assume { :begin_inline_cstrchr } true;cstrchr_#in~s.base, cstrchr_#in~s.offset, cstrchr_#in~c := main_~nondetString~0.base, main_~nondetString~0.offset, main_#t~nondet10;havoc cstrchr_#res.base, cstrchr_#res.offset;havoc cstrchr_#t~post5.base, cstrchr_#t~post5.offset, cstrchr_#t~mem2, cstrchr_#t~mem3, cstrchr_#t~short4, cstrchr_#t~mem6, cstrchr_#t~ite7.base, cstrchr_#t~ite7.offset, cstrchr_~s.base, cstrchr_~s.offset, cstrchr_~c;cstrchr_~s.base, cstrchr_~s.offset := cstrchr_#in~s.base, cstrchr_#in~s.offset;cstrchr_~c := cstrchr_#in~c; 16#L549-9true [2018-11-10 07:56:37,217 INFO L795 eck$LassoCheckResult]: Loop: 16#L549-9true assume true; 3#L549-1true SUMMARY for call cstrchr_#t~mem2 := read~int(cstrchr_~s.base, cstrchr_~s.offset, 1); srcloc: L549-1 6#L549-2true cstrchr_#t~short4 := cstrchr_#t~mem2 != 0; 7#L549-3true assume !cstrchr_#t~short4; 13#L549-7true assume !!cstrchr_#t~short4;havoc cstrchr_#t~mem3;havoc cstrchr_#t~mem2;havoc cstrchr_#t~short4;cstrchr_#t~post5.base, cstrchr_#t~post5.offset := cstrchr_~s.base, cstrchr_~s.offset;cstrchr_~s.base, cstrchr_~s.offset := cstrchr_#t~post5.base, cstrchr_#t~post5.offset + 1;havoc cstrchr_#t~post5.base, cstrchr_#t~post5.offset; 16#L549-9true [2018-11-10 07:56:37,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:56:37,222 INFO L82 PathProgramCache]: Analyzing trace with hash 889568230, now seen corresponding path program 1 times [2018-11-10 07:56:37,223 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:56:37,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:56:37,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:37,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:56:37,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:56:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:56:37,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:56:37,305 INFO L82 PathProgramCache]: Analyzing trace with hash 43006517, now seen corresponding path program 1 times [2018-11-10 07:56:37,305 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:56:37,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:56:37,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:37,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:56:37,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:37,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:56:37,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:56:37,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:56:37,348 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:56:37,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:56:37,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:56:37,363 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-11-10 07:56:37,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:56:37,388 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-10 07:56:37,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:56:37,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2018-11-10 07:56:37,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 07:56:37,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 13 states and 14 transitions. [2018-11-10 07:56:37,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-10 07:56:37,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-10 07:56:37,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2018-11-10 07:56:37,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:56:37,394 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-10 07:56:37,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2018-11-10 07:56:37,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-10 07:56:37,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-10 07:56:37,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-10 07:56:37,411 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-10 07:56:37,411 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-10 07:56:37,411 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 07:56:37,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2018-11-10 07:56:37,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 07:56:37,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:56:37,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:56:37,412 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:56:37,412 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:56:37,412 INFO L793 eck$LassoCheckResult]: Stem: 62#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 60#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~ret11.base, main_#t~ret11.offset, main_~length~0, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8; 57#L555 assume !(main_~length~0 < 1); 58#L555-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 61#L559 SUMMARY for call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L559 52#L559-1 assume { :begin_inline_cstrchr } true;cstrchr_#in~s.base, cstrchr_#in~s.offset, cstrchr_#in~c := main_~nondetString~0.base, main_~nondetString~0.offset, main_#t~nondet10;havoc cstrchr_#res.base, cstrchr_#res.offset;havoc cstrchr_#t~post5.base, cstrchr_#t~post5.offset, cstrchr_#t~mem2, cstrchr_#t~mem3, cstrchr_#t~short4, cstrchr_#t~mem6, cstrchr_#t~ite7.base, cstrchr_#t~ite7.offset, cstrchr_~s.base, cstrchr_~s.offset, cstrchr_~c;cstrchr_~s.base, cstrchr_~s.offset := cstrchr_#in~s.base, cstrchr_#in~s.offset;cstrchr_~c := cstrchr_#in~c; 53#L549-9 [2018-11-10 07:56:37,413 INFO L795 eck$LassoCheckResult]: Loop: 53#L549-9 assume true; 50#L549-1 SUMMARY for call cstrchr_#t~mem2 := read~int(cstrchr_~s.base, cstrchr_~s.offset, 1); srcloc: L549-1 51#L549-2 cstrchr_#t~short4 := cstrchr_#t~mem2 != 0; 54#L549-3 assume cstrchr_#t~short4; 55#L549-4 SUMMARY for call cstrchr_#t~mem3 := read~int(cstrchr_~s.base, cstrchr_~s.offset, 1); srcloc: L549-4 56#L549-5 cstrchr_#t~short4 := cstrchr_#t~mem3 != (if cstrchr_~c % 256 <= 127 then cstrchr_~c % 256 else cstrchr_~c % 256 - 256); 59#L549-7 assume !!cstrchr_#t~short4;havoc cstrchr_#t~mem3;havoc cstrchr_#t~mem2;havoc cstrchr_#t~short4;cstrchr_#t~post5.base, cstrchr_#t~post5.offset := cstrchr_~s.base, cstrchr_~s.offset;cstrchr_~s.base, cstrchr_~s.offset := cstrchr_#t~post5.base, cstrchr_#t~post5.offset + 1;havoc cstrchr_#t~post5.base, cstrchr_#t~post5.offset; 53#L549-9 [2018-11-10 07:56:37,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:56:37,413 INFO L82 PathProgramCache]: Analyzing trace with hash 889568230, now seen corresponding path program 2 times [2018-11-10 07:56:37,413 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:56:37,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:56:37,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:37,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:56:37,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:56:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:56:37,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:56:37,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1620537192, now seen corresponding path program 1 times [2018-11-10 07:56:37,433 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:56:37,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:56:37,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:37,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:56:37,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:56:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:56:37,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:56:37,452 INFO L82 PathProgramCache]: Analyzing trace with hash 318216467, now seen corresponding path program 1 times [2018-11-10 07:56:37,452 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:56:37,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:56:37,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:37,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:56:37,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:56:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:56:37,593 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2018-11-10 07:56:37,819 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2018-11-10 07:56:37,862 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:56:37,863 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:56:37,863 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:56:37,863 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:56:37,863 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:56:37,863 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:56:37,863 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:56:37,863 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:56:37,863 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrchr-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-10 07:56:37,864 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:56:37,864 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:56:37,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:56:37,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:56:37,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:56:37,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:56:37,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:56:37,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:56:37,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:56:37,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:56:37,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:56:38,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:56:38,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:56:38,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:56:38,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:56:38,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:56:38,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:56:38,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:56:38,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:56:38,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:56:38,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:56:38,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:56:38,389 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-10 07:56:38,483 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:56:38,488 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:56:38,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:56:38,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:56:38,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:56:38,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:56:38,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:56:38,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:56:38,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:56:38,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:56:38,496 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:56:38,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:56:38,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:56:38,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:56:38,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:56:38,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:56:38,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:56:38,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:56:38,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:56:38,498 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:56:38,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:56:38,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:56:38,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:56:38,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:56:38,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:56:38,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:56:38,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:56:38,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:56:38,500 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:56:38,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:56:38,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:56:38,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:56:38,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:56:38,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:56:38,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:56:38,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:56:38,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:56:38,502 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:56:38,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:56:38,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:56:38,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:56:38,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:56:38,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:56:38,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:56:38,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:56:38,506 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:56:38,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:56:38,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:56:38,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:56:38,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:56:38,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:56:38,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:56:38,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:56:38,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:56:38,508 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:56:38,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:56:38,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:56:38,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:56:38,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:56:38,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:56:38,510 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:56:38,510 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:56:38,515 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:56:38,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:56:38,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:56:38,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:56:38,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:56:38,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:56:38,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:56:38,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:56:38,521 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:56:38,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:56:38,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:56:38,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:56:38,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:56:38,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:56:38,525 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:56:38,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:56:38,532 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:56:38,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:56:38,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:56:38,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:56:38,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:56:38,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:56:38,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:56:38,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:56:38,539 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:56:38,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:56:38,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:56:38,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:56:38,540 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-10 07:56:38,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:56:38,568 INFO L402 nArgumentSynthesizer]: We have 96 Motzkin's Theorem applications. [2018-11-10 07:56:38,568 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-10 07:56:38,672 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:56:38,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:56:38,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:56:38,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:56:38,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:56:38,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:56:38,675 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:56:38,675 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:56:38,677 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:56:38,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:56:38,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:56:38,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:56:38,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:56:38,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:56:38,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:56:38,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:56:38,683 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:56:38,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:56:38,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:56:38,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:56:38,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:56:38,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:56:38,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:56:38,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:56:38,687 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:56:38,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:56:38,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:56:38,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:56:38,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:56:38,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:56:38,690 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:56:38,690 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:56:38,708 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:56:38,720 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 07:56:38,720 INFO L444 ModelExtractionUtils]: 27 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 07:56:38,722 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:56:38,722 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:56:38,723 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:56:38,723 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrchr_~s.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1) = -1*ULTIMATE.start_cstrchr_~s.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1 Supporting invariants [] [2018-11-10 07:56:38,751 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2018-11-10 07:56:38,756 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:56:38,757 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 07:56:38,757 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 07:56:38,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:56:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:38,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:56:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:38,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:56:38,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:56:38,823 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-10 07:56:38,824 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand 5 states. [2018-11-10 07:56:38,866 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2. Second operand 5 states. Result 20 states and 22 transitions. Complement of second has 7 states. [2018-11-10 07:56:38,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:56:38,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 07:56:38,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-10 07:56:38,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 6 letters. Loop has 7 letters. [2018-11-10 07:56:38,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:56:38,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 13 letters. Loop has 7 letters. [2018-11-10 07:56:38,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:56:38,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 6 letters. Loop has 14 letters. [2018-11-10 07:56:38,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:56:38,870 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2018-11-10 07:56:38,870 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:56:38,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2018-11-10 07:56:38,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 07:56:38,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 07:56:38,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 07:56:38,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:56:38,871 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:56:38,871 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:56:38,871 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:56:38,871 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 07:56:38,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:56:38,871 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:56:38,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 07:56:38,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 07:56:38 BoogieIcfgContainer [2018-11-10 07:56:38,876 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 07:56:38,876 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:56:38,876 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:56:38,876 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:56:38,877 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:56:37" (3/4) ... [2018-11-10 07:56:38,880 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 07:56:38,880 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:56:38,881 INFO L168 Benchmark]: Toolchain (without parser) took 2317.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 956.5 MB in the beginning and 1.0 GB in the end (delta: -71.0 MB). Peak memory consumption was 66.4 MB. Max. memory is 11.5 GB. [2018-11-10 07:56:38,881 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:56:38,882 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.87 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 929.6 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:56:38,882 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -204.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-10 07:56:38,883 INFO L168 Benchmark]: Boogie Preprocessor took 17.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:56:38,883 INFO L168 Benchmark]: RCFGBuilder took 181.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-10 07:56:38,884 INFO L168 Benchmark]: BuchiAutomizer took 1744.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.1 MB). Peak memory consumption was 87.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:56:38,884 INFO L168 Benchmark]: Witness Printer took 3.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:56:38,887 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 297.87 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 929.6 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -204.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 181.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1744.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.1 MB). Peak memory consumption was 87.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * 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 -1 * s + unknown-#length-unknown[#Ultimate.alloc_#res] 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 1.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 13 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 31 SDtfs, 12 SDslu, 24 SDs, 0 SdLazy, 15 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital190 mio100 ax110 hnf99 lsp89 ukn83 mio100 lsp32 div141 bol100 ite100 ukn100 eq153 hnf77 smp100 dnf729 smp27 tf100 neg95 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 132ms VariablesStem: 3 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 96 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...