./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_81552e56-449e-4cc5-8055-cad70b23454f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_81552e56-449e-4cc5-8055-cad70b23454f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_81552e56-449e-4cc5-8055-cad70b23454f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_81552e56-449e-4cc5-8055-cad70b23454f/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_81552e56-449e-4cc5-8055-cad70b23454f/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_81552e56-449e-4cc5-8055-cad70b23454f/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60847b137b78d6fc8305d5c5fcc8bf5228130e36 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:35:55,589 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:35:55,590 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:35:55,597 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:35:55,597 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:35:55,598 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:35:55,599 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:35:55,600 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:35:55,601 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:35:55,602 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:35:55,603 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:35:55,603 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:35:55,604 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:35:55,604 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:35:55,605 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:35:55,605 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:35:55,606 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:35:55,607 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:35:55,608 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:35:55,609 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:35:55,610 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:35:55,611 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:35:55,613 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:35:55,613 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:35:55,613 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:35:55,614 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:35:55,614 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:35:55,615 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:35:55,615 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:35:55,616 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:35:55,616 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:35:55,616 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:35:55,616 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:35:55,616 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:35:55,617 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:35:55,617 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:35:55,618 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_81552e56-449e-4cc5-8055-cad70b23454f/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 07:35:55,625 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:35:55,626 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:35:55,626 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:35:55,627 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:35:55,627 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:35:55,627 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 07:35:55,627 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 07:35:55,627 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 07:35:55,627 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 07:35:55,627 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 07:35:55,628 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 07:35:55,628 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:35:55,628 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:35:55,628 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 07:35:55,628 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:35:55,628 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:35:55,628 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:35:55,629 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 07:35:55,629 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 07:35:55,629 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 07:35:55,629 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:35:55,629 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:35:55,629 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 07:35:55,629 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 07:35:55,630 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:35:55,630 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:35:55,630 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 07:35:55,630 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:35:55,630 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:35:55,630 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 07:35:55,631 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 07:35:55,631 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_81552e56-449e-4cc5-8055-cad70b23454f/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 60847b137b78d6fc8305d5c5fcc8bf5228130e36 [2018-11-10 07:35:55,658 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:35:55,668 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:35:55,671 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:35:55,672 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:35:55,673 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:35:55,673 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_81552e56-449e-4cc5-8055-cad70b23454f/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-11-10 07:35:55,722 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_81552e56-449e-4cc5-8055-cad70b23454f/bin-2019/uautomizer/data/513bc5664/3ee2ab035e8a4a23a69b72374b803038/FLAG7375a27a6 [2018-11-10 07:35:56,096 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:35:56,097 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_81552e56-449e-4cc5-8055-cad70b23454f/sv-benchmarks/c/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-11-10 07:35:56,103 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_81552e56-449e-4cc5-8055-cad70b23454f/bin-2019/uautomizer/data/513bc5664/3ee2ab035e8a4a23a69b72374b803038/FLAG7375a27a6 [2018-11-10 07:35:56,111 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_81552e56-449e-4cc5-8055-cad70b23454f/bin-2019/uautomizer/data/513bc5664/3ee2ab035e8a4a23a69b72374b803038 [2018-11-10 07:35:56,113 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:35:56,115 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:35:56,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:35:56,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:35:56,118 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:35:56,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:35:56" (1/1) ... [2018-11-10 07:35:56,121 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7828c743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:56, skipping insertion in model container [2018-11-10 07:35:56,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:35:56" (1/1) ... [2018-11-10 07:35:56,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:35:56,154 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:35:56,340 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:35:56,346 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:35:56,372 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:35:56,403 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:35:56,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:56 WrapperNode [2018-11-10 07:35:56,404 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:35:56,404 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:35:56,405 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:35:56,405 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:35:56,411 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:35:56" (1/1) ... [2018-11-10 07:35:56,468 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:35:56" (1/1) ... [2018-11-10 07:35:56,491 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:35:56,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:35:56,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:35:56,491 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:35:56,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:56" (1/1) ... [2018-11-10 07:35:56,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:56" (1/1) ... [2018-11-10 07:35:56,502 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:56" (1/1) ... [2018-11-10 07:35:56,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:56" (1/1) ... [2018-11-10 07:35:56,507 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:56" (1/1) ... [2018-11-10 07:35:56,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:56" (1/1) ... [2018-11-10 07:35:56,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:56" (1/1) ... [2018-11-10 07:35:56,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:35:56,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:35:56,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:35:56,515 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:35:56,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81552e56-449e-4cc5-8055-cad70b23454f/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:35:56,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 07:35:56,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 07:35:56,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:35:56,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:35:56,782 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:35:56,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:35:56 BoogieIcfgContainer [2018-11-10 07:35:56,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:35:56,782 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 07:35:56,782 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 07:35:56,785 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 07:35:56,786 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:35:56,786 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 07:35:56" (1/3) ... [2018-11-10 07:35:56,787 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6db0c0b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:35:56, skipping insertion in model container [2018-11-10 07:35:56,787 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:35:56,787 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:35:56" (2/3) ... [2018-11-10 07:35:56,788 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6db0c0b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:35:56, skipping insertion in model container [2018-11-10 07:35:56,788 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:35:56,788 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:35:56" (3/3) ... [2018-11-10 07:35:56,789 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-11-10 07:35:56,838 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:35:56,839 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 07:35:56,839 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 07:35:56,839 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 07:35:56,839 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:35:56,839 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:35:56,839 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 07:35:56,839 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:35:56,839 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 07:35:56,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-11-10 07:35:56,874 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 07:35:56,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:35:56,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:35:56,880 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:35:56,880 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:35:56,880 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 07:35:56,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-11-10 07:35:56,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 07:35:56,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:35:56,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:35:56,882 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:35:56,882 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:35:56,890 INFO L793 eck$LassoCheckResult]: Stem: 29#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~nondet13, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet13;havoc main_#t~nondet13;main_~length2~0 := main_#t~nondet14;havoc main_#t~nondet14; 21#L558true assume !(main_~length1~0 < 1); 23#L558-2true assume !(main_~length2~0 < 1); 18#L561-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~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~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~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~malloc16.base, main_#t~malloc16.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset; 7#L566true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 9#L566-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 22#L567true assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet17;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~short7, cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset, cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset, cstrncmp_#t~post2, cstrncmp_#t~mem3, cstrncmp_#t~mem4, cstrncmp_#t~short5, cstrncmp_#t~mem10, cstrncmp_#t~mem11, cstrncmp_#t~ite12, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n, cstrncmp_~uc1~0, cstrncmp_~uc2~0;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n;havoc cstrncmp_~uc1~0;havoc cstrncmp_~uc2~0; 25#L543true assume !(cstrncmp_~n == 0); 3#L545-9true [2018-11-10 07:35:56,891 INFO L795 eck$LassoCheckResult]: Loop: 3#L545-9true assume true; 24#L545-1true cstrncmp_#t~post2 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post2 - 1;cstrncmp_#t~short5 := cstrncmp_#t~post2 > 0; 26#L545-2true assume !cstrncmp_#t~short5; 20#L545-7true assume !!cstrncmp_#t~short5;havoc cstrncmp_#t~mem4;havoc cstrncmp_#t~short5;havoc cstrncmp_#t~mem3;havoc cstrncmp_#t~post2;cstrncmp_#t~short7 := cstrncmp_~n == 0; 5#L546true assume cstrncmp_#t~short7; 28#L546-4true assume !cstrncmp_#t~short7;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~short7;cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset + 1;havoc cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset;cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset + 1;havoc cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset; 3#L545-9true [2018-11-10 07:35:56,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:35:56,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1298223692, now seen corresponding path program 1 times [2018-11-10 07:35:56,898 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:35:56,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:35:56,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:35:56,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:35:56,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:35:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:35:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:35:57,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:35:57,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1688417939, now seen corresponding path program 1 times [2018-11-10 07:35:57,020 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:35:57,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:35:57,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:35:57,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:35:57,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:35:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:35:57,053 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:35:57,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:35:57,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:35:57,059 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:35:57,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:35:57,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:35:57,072 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2018-11-10 07:35:57,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:35:57,101 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2018-11-10 07:35:57,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:35:57,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2018-11-10 07:35:57,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 07:35:57,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 23 transitions. [2018-11-10 07:35:57,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-10 07:35:57,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 07:35:57,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-11-10 07:35:57,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:35:57,108 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-10 07:35:57,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-11-10 07:35:57,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-10 07:35:57,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-10 07:35:57,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-10 07:35:57,126 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-10 07:35:57,126 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-10 07:35:57,126 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 07:35:57,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-11-10 07:35:57,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 07:35:57,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:35:57,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:35:57,128 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:35:57,128 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:35:57,128 INFO L793 eck$LassoCheckResult]: Stem: 87#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 85#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet13;havoc main_#t~nondet13;main_~length2~0 := main_#t~nondet14;havoc main_#t~nondet14; 70#L558 assume !(main_~length1~0 < 1); 71#L558-2 assume !(main_~length2~0 < 1); 79#L561-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~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~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~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~malloc16.base, main_#t~malloc16.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset; 80#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 81#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 77#L567 assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet17;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~short7, cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset, cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset, cstrncmp_#t~post2, cstrncmp_#t~mem3, cstrncmp_#t~mem4, cstrncmp_#t~short5, cstrncmp_#t~mem10, cstrncmp_#t~mem11, cstrncmp_#t~ite12, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n, cstrncmp_~uc1~0, cstrncmp_~uc2~0;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n;havoc cstrncmp_~uc1~0;havoc cstrncmp_~uc2~0; 78#L543 assume !(cstrncmp_~n == 0); 72#L545-9 [2018-11-10 07:35:57,128 INFO L795 eck$LassoCheckResult]: Loop: 72#L545-9 assume true; 73#L545-1 cstrncmp_#t~post2 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post2 - 1;cstrncmp_#t~short5 := cstrncmp_#t~post2 > 0; 83#L545-2 assume cstrncmp_#t~short5; 84#L545-3 SUMMARY for call cstrncmp_#t~mem3 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1); srcloc: L545-3 86#L545-4 SUMMARY for call cstrncmp_#t~mem4 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1); srcloc: L545-4 88#L545-5 cstrncmp_#t~short5 := cstrncmp_#t~mem3 == cstrncmp_#t~mem4; 89#L545-7 assume !!cstrncmp_#t~short5;havoc cstrncmp_#t~mem4;havoc cstrncmp_#t~short5;havoc cstrncmp_#t~mem3;havoc cstrncmp_#t~post2;cstrncmp_#t~short7 := cstrncmp_~n == 0; 74#L546 assume cstrncmp_#t~short7; 76#L546-4 assume !cstrncmp_#t~short7;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~short7;cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset + 1;havoc cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset;cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset + 1;havoc cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset; 72#L545-9 [2018-11-10 07:35:57,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:35:57,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1298223692, now seen corresponding path program 2 times [2018-11-10 07:35:57,129 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:35:57,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:35:57,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:35:57,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:35:57,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:35:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:35:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:35:57,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:35:57,157 INFO L82 PathProgramCache]: Analyzing trace with hash 856309616, now seen corresponding path program 1 times [2018-11-10 07:35:57,157 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:35:57,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:35:57,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:35:57,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:35:57,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:35:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:35:57,183 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:35:57,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:35:57,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:35:57,184 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:35:57,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:35:57,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:35:57,185 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-10 07:35:57,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:35:57,200 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-10 07:35:57,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:35:57,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2018-11-10 07:35:57,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 07:35:57,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 22 transitions. [2018-11-10 07:35:57,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-10 07:35:57,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 07:35:57,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2018-11-10 07:35:57,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:35:57,202 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-10 07:35:57,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2018-11-10 07:35:57,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-10 07:35:57,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-10 07:35:57,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-10 07:35:57,205 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-10 07:35:57,205 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-10 07:35:57,205 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 07:35:57,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2018-11-10 07:35:57,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 07:35:57,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:35:57,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:35:57,207 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:35:57,207 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:35:57,207 INFO L793 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 132#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet13;havoc main_#t~nondet13;main_~length2~0 := main_#t~nondet14;havoc main_#t~nondet14; 117#L558 assume !(main_~length1~0 < 1); 118#L558-2 assume !(main_~length2~0 < 1); 125#L561-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~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~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~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~malloc16.base, main_#t~malloc16.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset; 126#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 127#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 123#L567 assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet17;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~short7, cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset, cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset, cstrncmp_#t~post2, cstrncmp_#t~mem3, cstrncmp_#t~mem4, cstrncmp_#t~short5, cstrncmp_#t~mem10, cstrncmp_#t~mem11, cstrncmp_#t~ite12, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n, cstrncmp_~uc1~0, cstrncmp_~uc2~0;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n;havoc cstrncmp_~uc1~0;havoc cstrncmp_~uc2~0; 124#L543 assume !(cstrncmp_~n == 0); 119#L545-9 [2018-11-10 07:35:57,207 INFO L795 eck$LassoCheckResult]: Loop: 119#L545-9 assume true; 120#L545-1 cstrncmp_#t~post2 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post2 - 1;cstrncmp_#t~short5 := cstrncmp_#t~post2 > 0; 128#L545-2 assume cstrncmp_#t~short5; 130#L545-3 SUMMARY for call cstrncmp_#t~mem3 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1); srcloc: L545-3 133#L545-4 SUMMARY for call cstrncmp_#t~mem4 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1); srcloc: L545-4 135#L545-5 cstrncmp_#t~short5 := cstrncmp_#t~mem3 == cstrncmp_#t~mem4; 136#L545-7 assume !!cstrncmp_#t~short5;havoc cstrncmp_#t~mem4;havoc cstrncmp_#t~short5;havoc cstrncmp_#t~mem3;havoc cstrncmp_#t~post2;cstrncmp_#t~short7 := cstrncmp_~n == 0; 121#L546 assume !cstrncmp_#t~short7; 122#L546-2 SUMMARY for call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1); srcloc: L546-2 129#L546-3 cstrncmp_#t~short7 := cstrncmp_#t~mem6 == 0; 131#L546-4 assume !cstrncmp_#t~short7;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~short7;cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset + 1;havoc cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset;cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset + 1;havoc cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset; 119#L545-9 [2018-11-10 07:35:57,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:35:57,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1298223692, now seen corresponding path program 3 times [2018-11-10 07:35:57,207 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:35:57,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:35:57,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:35:57,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:35:57,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:35:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:35:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:35:57,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:35:57,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1720125395, now seen corresponding path program 1 times [2018-11-10 07:35:57,231 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:35:57,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:35:57,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:35:57,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:35:57,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:35:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:35:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:35:57,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:35:57,248 INFO L82 PathProgramCache]: Analyzing trace with hash -42215166, now seen corresponding path program 1 times [2018-11-10 07:35:57,249 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:35:57,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:35:57,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:35:57,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:35:57,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:35:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:35:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:35:57,479 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2018-11-10 07:35:57,739 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 95 [2018-11-10 07:35:57,843 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:35:57,844 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:35:57,844 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:35:57,844 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:35:57,845 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:35:57,845 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:35:57,845 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:35:57,845 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:35:57,845 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncmp-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-10 07:35:57,845 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:35:57,846 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:35:57,861 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:35:57,865 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:35:57,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:35:57,869 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:35:58,131 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2018-11-10 07:35:58,263 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2018-11-10 07:35:58,264 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:35:58,265 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:35:58,266 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:35:58,269 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:35:58,270 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:35:58,272 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:35:58,274 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:35:58,275 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:35:58,277 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:35:58,278 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:35:58,280 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:35:58,281 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:35:58,283 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:35:58,284 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:35:58,286 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:35:58,295 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:35:58,296 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:35:58,297 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:35:58,299 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:35:58,300 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:35:58,719 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:35:58,722 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:35:58,724 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:35:58,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:35:58,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:35:58,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:35:58,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:35:58,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:35:58,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:35:58,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:35:58,730 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:35:58,730 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:35:58,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:35:58,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:35:58,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:35:58,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:35:58,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:35:58,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:35:58,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:35:58,733 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:35:58,733 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:35:58,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:35:58,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:35:58,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:35:58,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:35:58,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:35:58,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:35:58,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:35:58,735 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:35:58,735 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:35:58,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:35:58,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:35:58,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:35:58,736 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 07:35:58,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:35:58,737 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 07:35:58,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:35:58,741 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:35:58,741 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:35:58,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:35:58,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:35:58,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:35:58,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:35:58,745 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:35:58,745 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:35:58,756 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:35:58,756 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:35:58,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:35:58,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:35:58,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:35:58,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:35:58,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:35:58,758 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:35:58,761 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:35:58,762 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:35:58,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:35:58,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:35:58,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:35:58,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:35:58,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:35:58,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:35:58,778 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:35:58,778 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:35:58,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:35:58,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:35:58,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:35:58,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:35:58,783 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:35:58,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:35:58,826 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:35:58,873 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 07:35:58,873 INFO L444 ModelExtractionUtils]: 52 out of 58 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 07:35:58,875 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:35:58,877 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:35:58,877 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:35:58,878 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1, ULTIMATE.start_cstrncmp_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1 - 1*ULTIMATE.start_cstrncmp_~s1.offset Supporting invariants [] [2018-11-10 07:35:58,925 INFO L297 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2018-11-10 07:35:58,933 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:35:58,935 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 07:35:58,936 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 07:35:58,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:35:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:35:58,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:35:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:35:59,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:35:59,049 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:35:59,051 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-10 07:35:59,052 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 3 Second operand 6 states. [2018-11-10 07:35:59,121 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 3. Second operand 6 states. Result 31 states and 34 transitions. Complement of second has 8 states. [2018-11-10 07:35:59,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:35:59,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 07:35:59,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-10 07:35:59,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 9 letters. Loop has 11 letters. [2018-11-10 07:35:59,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:35:59,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 20 letters. Loop has 11 letters. [2018-11-10 07:35:59,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:35:59,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 9 letters. Loop has 22 letters. [2018-11-10 07:35:59,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:35:59,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 34 transitions. [2018-11-10 07:35:59,127 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:35:59,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2018-11-10 07:35:59,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 07:35:59,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 07:35:59,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 07:35:59,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:35:59,128 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:35:59,128 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:35:59,128 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:35:59,128 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 07:35:59,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:35:59,128 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:35:59,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 07:35:59,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 07:35:59 BoogieIcfgContainer [2018-11-10 07:35:59,134 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 07:35:59,134 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:35:59,134 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:35:59,134 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:35:59,135 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:35:56" (3/4) ... [2018-11-10 07:35:59,138 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 07:35:59,138 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:35:59,139 INFO L168 Benchmark]: Toolchain (without parser) took 3024.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 955.5 MB in the beginning and 866.5 MB in the end (delta: 88.9 MB). Peak memory consumption was 222.6 MB. Max. memory is 11.5 GB. [2018-11-10 07:35:59,139 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:35:59,140 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.92 ms. Allocated memory is still 1.0 GB. Free memory was 955.5 MB in the beginning and 934.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 07:35:59,140 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -196.4 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-10 07:35:59,141 INFO L168 Benchmark]: Boogie Preprocessor took 23.86 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:35:59,142 INFO L168 Benchmark]: RCFGBuilder took 267.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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:35:59,142 INFO L168 Benchmark]: BuchiAutomizer took 2351.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 866.5 MB in the end (delta: 236.1 MB). Peak memory consumption was 236.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:35:59,143 INFO L168 Benchmark]: Witness Printer took 3.80 ms. Allocated memory is still 1.2 GB. Free memory is still 866.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:35:59,146 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.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 288.92 ms. Allocated memory is still 1.0 GB. Free memory was 955.5 MB in the beginning and 934.0 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 86.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -196.4 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.86 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 267.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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2351.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 866.5 MB in the end (delta: 236.1 MB). Peak memory consumption was 236.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.80 ms. Allocated memory is still 1.2 GB. Free memory is still 866.5 MB. 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 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s1 and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 74 SDtfs, 23 SDslu, 68 SDs, 0 SdLazy, 27 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital239 mio100 ax100 hnf99 lsp88 ukn109 mio100 lsp43 div100 bol100 ite100 ukn100 eq201 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...