./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strchr_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_d35d689f-f401-42ce-a8be-9d9c80c824ba/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d35d689f-f401-42ce-a8be-9d9c80c824ba/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d35d689f-f401-42ce-a8be-9d9c80c824ba/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d35d689f-f401-42ce-a8be-9d9c80c824ba/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strchr_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d35d689f-f401-42ce-a8be-9d9c80c824ba/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d35d689f-f401-42ce-a8be-9d9c80c824ba/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 eae91250bd54f01dff46ae6aab61c3076a74de3d ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 06:05:30,921 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 06:05:30,922 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 06:05:30,928 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 06:05:30,928 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 06:05:30,929 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 06:05:30,930 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 06:05:30,931 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 06:05:30,932 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 06:05:30,933 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 06:05:30,933 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 06:05:30,933 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 06:05:30,934 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 06:05:30,935 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 06:05:30,936 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 06:05:30,936 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 06:05:30,937 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 06:05:30,938 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 06:05:30,939 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 06:05:30,940 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 06:05:30,941 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 06:05:30,942 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 06:05:30,943 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 06:05:30,943 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 06:05:30,944 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 06:05:30,944 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 06:05:30,945 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 06:05:30,946 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 06:05:30,946 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 06:05:30,947 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 06:05:30,947 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 06:05:30,947 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 06:05:30,948 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 06:05:30,948 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 06:05:30,948 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 06:05:30,949 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 06:05:30,949 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d35d689f-f401-42ce-a8be-9d9c80c824ba/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 06:05:30,960 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 06:05:30,960 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 06:05:30,961 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 06:05:30,961 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 06:05:30,962 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 06:05:30,962 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 06:05:30,962 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 06:05:30,962 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 06:05:30,963 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 06:05:30,963 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 06:05:30,963 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 06:05:30,963 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 06:05:30,963 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 06:05:30,963 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 06:05:30,964 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 06:05:30,964 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 06:05:30,964 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 06:05:30,964 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 06:05:30,964 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 06:05:30,964 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 06:05:30,964 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 06:05:30,965 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 06:05:30,965 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 06:05:30,965 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 06:05:30,965 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 06:05:30,965 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 06:05:30,965 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 06:05:30,966 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 06:05:30,966 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_d35d689f-f401-42ce-a8be-9d9c80c824ba/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 -> eae91250bd54f01dff46ae6aab61c3076a74de3d [2018-11-10 06:05:30,989 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 06:05:30,998 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 06:05:31,001 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 06:05:31,002 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 06:05:31,002 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 06:05:31,003 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d35d689f-f401-42ce-a8be-9d9c80c824ba/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strchr_true-termination.c.i [2018-11-10 06:05:31,038 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d35d689f-f401-42ce-a8be-9d9c80c824ba/bin-2019/uautomizer/data/a055997c5/26edfee7f0e74aa5970af2cbac6fefbb/FLAG2911bf87d [2018-11-10 06:05:31,461 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 06:05:31,462 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d35d689f-f401-42ce-a8be-9d9c80c824ba/sv-benchmarks/c/termination-libowfat/strchr_true-termination.c.i [2018-11-10 06:05:31,468 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d35d689f-f401-42ce-a8be-9d9c80c824ba/bin-2019/uautomizer/data/a055997c5/26edfee7f0e74aa5970af2cbac6fefbb/FLAG2911bf87d [2018-11-10 06:05:31,478 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d35d689f-f401-42ce-a8be-9d9c80c824ba/bin-2019/uautomizer/data/a055997c5/26edfee7f0e74aa5970af2cbac6fefbb [2018-11-10 06:05:31,480 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 06:05:31,482 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 06:05:31,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 06:05:31,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 06:05:31,484 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 06:05:31,485 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:05:31" (1/1) ... [2018-11-10 06:05:31,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f0e58b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:31, skipping insertion in model container [2018-11-10 06:05:31,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:05:31" (1/1) ... [2018-11-10 06:05:31,493 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 06:05:31,520 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 06:05:31,689 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:05:31,696 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 06:05:31,721 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:05:31,753 INFO L193 MainTranslator]: Completed translation [2018-11-10 06:05:31,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:31 WrapperNode [2018-11-10 06:05:31,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 06:05:31,754 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 06:05:31,754 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 06:05:31,754 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 06:05:31,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:31" (1/1) ... [2018-11-10 06:05:31,810 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:31" (1/1) ... [2018-11-10 06:05:31,824 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 06:05:31,825 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 06:05:31,825 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 06:05:31,825 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 06:05:31,831 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:31" (1/1) ... [2018-11-10 06:05:31,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:31" (1/1) ... [2018-11-10 06:05:31,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:31" (1/1) ... [2018-11-10 06:05:31,833 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:31" (1/1) ... [2018-11-10 06:05:31,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:31" (1/1) ... [2018-11-10 06:05:31,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:31" (1/1) ... [2018-11-10 06:05:31,840 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:31" (1/1) ... [2018-11-10 06:05:31,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 06:05:31,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 06:05:31,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 06:05:31,841 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 06:05:31,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d35d689f-f401-42ce-a8be-9d9c80c824ba/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 06:05:31,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 06:05:31,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 06:05:31,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 06:05:31,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 06:05:32,118 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 06:05:32,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:05:32 BoogieIcfgContainer [2018-11-10 06:05:32,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 06:05:32,119 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 06:05:32,119 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 06:05:32,122 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 06:05:32,122 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:05:32,123 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 06:05:31" (1/3) ... [2018-11-10 06:05:32,123 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@764c1a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 06:05:32, skipping insertion in model container [2018-11-10 06:05:32,123 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:05:32,123 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:31" (2/3) ... [2018-11-10 06:05:32,124 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@764c1a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 06:05:32, skipping insertion in model container [2018-11-10 06:05:32,124 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:05:32,124 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:05:32" (3/3) ... [2018-11-10 06:05:32,125 INFO L375 chiAutomizerObserver]: Analyzing ICFG strchr_true-termination.c.i [2018-11-10 06:05:32,163 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 06:05:32,164 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 06:05:32,164 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 06:05:32,164 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 06:05:32,164 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 06:05:32,164 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 06:05:32,164 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 06:05:32,164 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 06:05:32,164 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 06:05:32,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-10 06:05:32,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-10 06:05:32,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:05:32,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:05:32,194 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 06:05:32,195 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:05:32,195 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 06:05:32,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-10 06:05:32,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-10 06:05:32,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:05:32,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:05:32,197 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 06:05:32,197 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:05:32,202 INFO L793 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~nondet16, main_#t~ret17.base, main_#t~ret17.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~the_int~0;main_~in_len~0 := main_#t~nondet14;havoc main_#t~nondet14; 13#L519true assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;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~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset; 8#L521true SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L521 10#L521-1true main_~the_int~0 := main_#t~nondet16;havoc main_#t~nondet16;assume { :begin_inline_strchr } true;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := main_~in~0.base, main_~in~0.offset, main_~the_int~0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem2, strchr_#t~mem3, strchr_#t~pre4.base, strchr_#t~pre4.offset, strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_#t~mem8, strchr_#t~mem9, strchr_#t~pre10.base, strchr_#t~pre10.offset, strchr_#t~mem11, strchr_#t~mem12, strchr_#t~pre13.base, strchr_#t~pre13.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); 30#L509-3true [2018-11-10 06:05:32,203 INFO L795 eck$LassoCheckResult]: Loop: 30#L509-3true assume true; 27#L509-1true assume !false; 9#L510true SUMMARY for call strchr_#t~mem2 := read~int(strchr_~t.base, strchr_~t.offset, 1); srcloc: L510 11#L510-1true assume !(strchr_#t~mem2 == strchr_~ch~0);havoc strchr_#t~mem2; 16#L510-3true SUMMARY for call strchr_#t~mem3 := read~int(strchr_~t.base, strchr_~t.offset, 1); srcloc: L510-3 18#L510-4true assume !(strchr_#t~mem3 == 0);havoc strchr_#t~mem3;strchr_#t~pre4.base, strchr_#t~pre4.offset := strchr_~t.base, strchr_~t.offset + 1;strchr_~t.base, strchr_~t.offset := strchr_~t.base, strchr_~t.offset + 1;havoc strchr_#t~pre4.base, strchr_#t~pre4.offset; 6#L511true SUMMARY for call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); srcloc: L511 23#L511-1true assume !(strchr_#t~mem5 == strchr_~ch~0);havoc strchr_#t~mem5; 28#L511-3true SUMMARY for call strchr_#t~mem6 := read~int(strchr_~t.base, strchr_~t.offset, 1); srcloc: L511-3 29#L511-4true assume !(strchr_#t~mem6 == 0);havoc strchr_#t~mem6;strchr_#t~pre7.base, strchr_#t~pre7.offset := strchr_~t.base, strchr_~t.offset + 1;strchr_~t.base, strchr_~t.offset := strchr_~t.base, strchr_~t.offset + 1;havoc strchr_#t~pre7.base, strchr_#t~pre7.offset; 21#L512true SUMMARY for call strchr_#t~mem8 := read~int(strchr_~t.base, strchr_~t.offset, 1); srcloc: L512 22#L512-1true assume !(strchr_#t~mem8 == strchr_~ch~0);havoc strchr_#t~mem8; 12#L512-3true SUMMARY for call strchr_#t~mem9 := read~int(strchr_~t.base, strchr_~t.offset, 1); srcloc: L512-3 15#L512-4true assume !(strchr_#t~mem9 == 0);havoc strchr_#t~mem9;strchr_#t~pre10.base, strchr_#t~pre10.offset := strchr_~t.base, strchr_~t.offset + 1;strchr_~t.base, strchr_~t.offset := strchr_~t.base, strchr_~t.offset + 1;havoc strchr_#t~pre10.base, strchr_#t~pre10.offset; 4#L513true SUMMARY for call strchr_#t~mem11 := read~int(strchr_~t.base, strchr_~t.offset, 1); srcloc: L513 5#L513-1true assume !(strchr_#t~mem11 == strchr_~ch~0);havoc strchr_#t~mem11; 24#L513-3true SUMMARY for call strchr_#t~mem12 := read~int(strchr_~t.base, strchr_~t.offset, 1); srcloc: L513-3 26#L513-4true assume !(strchr_#t~mem12 == 0);havoc strchr_#t~mem12;strchr_#t~pre13.base, strchr_#t~pre13.offset := strchr_~t.base, strchr_~t.offset + 1;strchr_~t.base, strchr_~t.offset := strchr_~t.base, strchr_~t.offset + 1;havoc strchr_#t~pre13.base, strchr_#t~pre13.offset; 30#L509-3true [2018-11-10 06:05:32,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:05:32,207 INFO L82 PathProgramCache]: Analyzing trace with hash 28695717, now seen corresponding path program 1 times [2018-11-10 06:05:32,208 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:05:32,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:05:32,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:05:32,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:05:32,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:05:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:05:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:05:32,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:05:32,300 INFO L82 PathProgramCache]: Analyzing trace with hash -694219122, now seen corresponding path program 1 times [2018-11-10 06:05:32,300 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:05:32,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:05:32,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:05:32,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:05:32,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:05:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:05:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:05:32,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:05:32,336 INFO L82 PathProgramCache]: Analyzing trace with hash -499348942, now seen corresponding path program 1 times [2018-11-10 06:05:32,336 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:05:32,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:05:32,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:05:32,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:05:32,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:05:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:05:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:05:32,618 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2018-11-10 06:05:32,761 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2018-11-10 06:05:32,883 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-11-10 06:05:32,891 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:05:32,892 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:05:32,892 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:05:32,892 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:05:32,893 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:05:32,893 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:05:32,893 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:05:32,893 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:05:32,893 INFO L131 ssoRankerPreferences]: Filename of dumped script: strchr_true-termination.c.i_Iteration1_Lasso [2018-11-10 06:05:32,893 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:05:32,894 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:05:32,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:05:32,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:05:32,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:05:32,923 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 06:05:32,925 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 06:05:32,928 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 06:05:33,245 WARN L179 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2018-11-10 06:05:33,335 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 06:05:33,337 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 06:05:33,338 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 06:05:33,340 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 06:05:33,343 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 06:05:33,344 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 06:05:33,345 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 06:05:33,346 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 06:05:33,348 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 06:05:33,352 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 06:05:33,356 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 06:05:33,358 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 06:05:33,359 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 06:05:33,361 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 06:05:33,363 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 06:05:33,365 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 06:05:33,367 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 06:05:33,370 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 06:05:33,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:05:33,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:05:33,553 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-10 06:05:38,505 WARN L179 SmtUtils]: Spent 4.86 s on a formula simplification. DAG size of input: 295 DAG size of output: 185 [2018-11-10 06:05:38,621 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:05:38,624 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:05:38,626 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 06:05:38,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:05:38,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:05:38,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:05:38,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:05:38,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:05:38,629 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:05:38,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:05:38,632 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:05:38,632 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 06:05:38,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:05:38,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:05:38,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:05:38,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:05:38,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:05:38,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:05:38,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:05:38,636 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:05:38,637 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 06:05:38,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:05:38,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:05:38,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:05:38,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:05:38,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:05:38,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:05:38,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:05:38,638 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:05:38,639 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 06:05:38,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:05:38,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:05:38,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:05:38,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:05:38,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:05:38,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:05:38,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:05:38,641 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:05:38,642 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 06:05:38,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:05:38,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:05:38,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:05:38,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:05:38,645 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:05:38,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:05:38,648 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:05:38,648 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 06:05:38,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:05:38,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:05:38,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:05:38,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:05:38,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:05:38,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:05:38,655 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:05:38,655 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 06:05:38,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:05:38,656 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 06:05:38,656 INFO L206 nArgumentSynthesizer]: 146 loop disjuncts [2018-11-10 06:05:38,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:05:45,212 INFO L402 nArgumentSynthesizer]: We have 43508 Motzkin's Theorem applications. [2018-11-10 06:05:45,212 INFO L403 nArgumentSynthesizer]: A total of 292 supporting invariants were added. [2018-11-10 06:06:33,530 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:06:33,530 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 06:06:33,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:06:33,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:06:33,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:06:33,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:06:33,532 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:06:33,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:06:33,533 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:06:33,534 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 06:06:33,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:06:33,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:06:33,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:06:33,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:06:33,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:06:33,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:06:33,535 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:06:33,536 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 06:06:33,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:06:33,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:06:33,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:06:33,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:06:33,537 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:06:33,537 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:06:33,539 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:06:33,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 06:06:33,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:06:33,540 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 06:06:33,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:06:33,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:06:33,541 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:06:33,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:06:33,544 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:06:33,545 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 06:06:33,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:06:33,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:06:33,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:06:33,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:06:33,546 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:06:33,546 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:06:33,547 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:06:33,548 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 06:06:33,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:06:33,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:06:33,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:06:33,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:06:33,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:06:33,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:06:33,559 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 06:06:33,578 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 06:06:33,578 INFO L444 ModelExtractionUtils]: 23 out of 31 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-10 06:06:33,580 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 06:06:33,581 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 06:06:33,581 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 06:06:33,582 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strchr_~t.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1) = -1*ULTIMATE.start_strchr_~t.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1 Supporting invariants [] [2018-11-10 06:06:33,611 INFO L297 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2018-11-10 06:06:33,616 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:06:33,618 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 06:06:33,618 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 06:06:33,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:06:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:06:33,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:06:33,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:06:33,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:06:33,805 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 06:06:33,819 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-10 06:06:33,820 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states. Second operand 8 states. [2018-11-10 06:06:35,103 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states.. Second operand 8 states. Result 64 states and 84 transitions. Complement of second has 8 states. [2018-11-10 06:06:35,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 06:06:35,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 06:06:35,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2018-11-10 06:06:35,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 5 letters. Loop has 18 letters. [2018-11-10 06:06:35,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:06:35,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 23 letters. Loop has 18 letters. [2018-11-10 06:06:35,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:06:35,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 5 letters. Loop has 36 letters. [2018-11-10 06:06:35,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:06:35,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 84 transitions. [2018-11-10 06:06:35,113 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 06:06:35,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 0 states and 0 transitions. [2018-11-10 06:06:35,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 06:06:35,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 06:06:35,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 06:06:35,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:06:35,117 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:06:35,117 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:06:35,117 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:06:35,117 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 06:06:35,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 06:06:35,117 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 06:06:35,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 06:06:35,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 06:06:35 BoogieIcfgContainer [2018-11-10 06:06:35,122 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 06:06:35,122 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 06:06:35,122 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 06:06:35,122 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 06:06:35,123 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:05:32" (3/4) ... [2018-11-10 06:06:35,126 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 06:06:35,126 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 06:06:35,127 INFO L168 Benchmark]: Toolchain (without parser) took 63645.60 ms. Allocated memory was 1.0 GB in the beginning and 7.1 GB in the end (delta: 6.1 GB). Free memory was 957.6 MB in the beginning and 4.7 GB in the end (delta: -3.7 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2018-11-10 06:06:35,127 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:06:35,128 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.45 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 06:06:35,129 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -195.4 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 06:06:35,130 INFO L168 Benchmark]: Boogie Preprocessor took 16.09 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 06:06:35,130 INFO L168 Benchmark]: RCFGBuilder took 277.84 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-10 06:06:35,131 INFO L168 Benchmark]: BuchiAutomizer took 63002.73 ms. Allocated memory was 1.2 GB in the beginning and 7.1 GB in the end (delta: 5.9 GB). Free memory was 1.1 GB in the beginning and 4.7 GB in the end (delta: -3.6 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2018-11-10 06:06:35,131 INFO L168 Benchmark]: Witness Printer took 3.81 ms. Allocated memory is still 7.1 GB. Free memory is still 4.7 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:06:35,134 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 271.45 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -195.4 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.09 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 277.84 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 63002.73 ms. Allocated memory was 1.2 GB in the beginning and 7.1 GB in the end (delta: 5.9 GB). Free memory was 1.1 GB in the beginning and 4.7 GB in the end (delta: -3.6 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 3.81 ms. Allocated memory is still 7.1 GB. Free memory is still 4.7 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 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * t + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 62.9s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 61.4s. Construction of modules took 0.0s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 25 SDtfs, 34 SDslu, 78 SDs, 0 SdLazy, 53 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital308 mio100 ax100 hnf99 lsp76 ukn109 mio100 lsp34 div128 bol100 ite100 ukn100 eq167 hnf79 smp82 dnf6956 smp42 tf100 neg76 sie161 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 54874ms VariablesStem: 6 VariablesLoop: 5 DisjunctsStem: 2 DisjunctsLoop: 146 SupportingInvariants: 292 MotzkinApplications: 43508 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...