./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a75fb663-8ef0-439e-8589-7dde5e9aeac4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a75fb663-8ef0-439e-8589-7dde5e9aeac4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a75fb663-8ef0-439e-8589-7dde5e9aeac4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a75fb663-8ef0-439e-8589-7dde5e9aeac4/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_a75fb663-8ef0-439e-8589-7dde5e9aeac4/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a75fb663-8ef0-439e-8589-7dde5e9aeac4/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-aa41828 [2018-11-23 01:32:57,520 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:32:57,522 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:32:57,531 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:32:57,532 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:32:57,532 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:32:57,533 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:32:57,535 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:32:57,536 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:32:57,537 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:32:57,538 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:32:57,538 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:32:57,539 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:32:57,539 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:32:57,540 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:32:57,541 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:32:57,542 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:32:57,543 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:32:57,544 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:32:57,545 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:32:57,546 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:32:57,547 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:32:57,549 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:32:57,549 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:32:57,550 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:32:57,550 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:32:57,551 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:32:57,551 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:32:57,552 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:32:57,553 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:32:57,553 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:32:57,553 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:32:57,553 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:32:57,554 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:32:57,554 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:32:57,554 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:32:57,555 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a75fb663-8ef0-439e-8589-7dde5e9aeac4/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 01:32:57,566 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:32:57,566 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:32:57,567 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 01:32:57,568 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 01:32:57,568 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 01:32:57,568 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 01:32:57,568 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 01:32:57,568 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 01:32:57,568 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 01:32:57,569 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 01:32:57,569 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 01:32:57,569 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:32:57,569 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:32:57,569 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 01:32:57,569 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:32:57,569 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:32:57,570 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:32:57,570 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 01:32:57,570 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 01:32:57,570 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 01:32:57,570 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:32:57,570 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:32:57,570 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 01:32:57,570 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:32:57,571 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 01:32:57,571 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:32:57,571 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 01:32:57,571 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 01:32:57,571 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:32:57,571 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 01:32:57,572 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 01:32:57,572 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 01:32:57,572 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_a75fb663-8ef0-439e-8589-7dde5e9aeac4/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-23 01:32:57,598 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:32:57,608 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:32:57,611 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:32:57,613 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:32:57,613 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:32:57,614 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a75fb663-8ef0-439e-8589-7dde5e9aeac4/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-11-23 01:32:57,665 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a75fb663-8ef0-439e-8589-7dde5e9aeac4/bin-2019/uautomizer/data/aa3f8b047/96e2cd940bc3481d89fe5c8c7c561ee0/FLAGbf6c13354 [2018-11-23 01:32:58,077 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:32:58,078 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a75fb663-8ef0-439e-8589-7dde5e9aeac4/sv-benchmarks/c/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-11-23 01:32:58,090 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a75fb663-8ef0-439e-8589-7dde5e9aeac4/bin-2019/uautomizer/data/aa3f8b047/96e2cd940bc3481d89fe5c8c7c561ee0/FLAGbf6c13354 [2018-11-23 01:32:58,101 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a75fb663-8ef0-439e-8589-7dde5e9aeac4/bin-2019/uautomizer/data/aa3f8b047/96e2cd940bc3481d89fe5c8c7c561ee0 [2018-11-23 01:32:58,104 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:32:58,106 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:32:58,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:32:58,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:32:58,109 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:32:58,110 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:32:58" (1/1) ... [2018-11-23 01:32:58,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ed7d6fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:58, skipping insertion in model container [2018-11-23 01:32:58,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:32:58" (1/1) ... [2018-11-23 01:32:58,119 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:32:58,151 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:32:58,375 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:32:58,384 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:32:58,477 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:32:58,511 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:32:58,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:58 WrapperNode [2018-11-23 01:32:58,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:32:58,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:32:58,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:32:58,513 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:32:58,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:58" (1/1) ... [2018-11-23 01:32:58,531 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:58" (1/1) ... [2018-11-23 01:32:58,547 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:32:58,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:32:58,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:32:58,547 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:32:58,553 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:58" (1/1) ... [2018-11-23 01:32:58,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:58" (1/1) ... [2018-11-23 01:32:58,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:58" (1/1) ... [2018-11-23 01:32:58,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:58" (1/1) ... [2018-11-23 01:32:58,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:58" (1/1) ... [2018-11-23 01:32:58,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:58" (1/1) ... [2018-11-23 01:32:58,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:58" (1/1) ... [2018-11-23 01:32:58,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:32:58,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:32:58,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:32:58,571 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:32:58,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a75fb663-8ef0-439e-8589-7dde5e9aeac4/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-23 01:32:58,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 01:32:58,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 01:32:58,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 01:32:58,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 01:32:58,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:32:58,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:32:58,829 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:32:58,829 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 01:32:58,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:32:58 BoogieIcfgContainer [2018-11-23 01:32:58,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:32:58,831 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 01:32:58,831 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 01:32:58,834 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 01:32:58,835 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 01:32:58,835 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 01:32:58" (1/3) ... [2018-11-23 01:32:58,836 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d586286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:32:58, skipping insertion in model container [2018-11-23 01:32:58,836 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 01:32:58,836 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:32:58" (2/3) ... [2018-11-23 01:32:58,837 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d586286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:32:58, skipping insertion in model container [2018-11-23 01:32:58,837 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 01:32:58,837 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:32:58" (3/3) ... [2018-11-23 01:32:58,838 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-11-23 01:32:58,880 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 01:32:58,881 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 01:32:58,881 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 01:32:58,881 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 01:32:58,881 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 01:32:58,881 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 01:32:58,881 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 01:32:58,881 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 01:32:58,881 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 01:32:58,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 01:32:58,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 01:32:58,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:32:58,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:32:58,916 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 01:32:58,916 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 01:32:58,916 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 01:32:58,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 01:32:58,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 01:32:58,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:32:58,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:32:58,918 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 01:32:58,919 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 01:32:58,924 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true 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; 3#L558true assume !(main_~length1~0 < 1); 6#L558-2true assume !(main_~length2~0 < 1); 19#L561-1true call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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; 9#L543true assume !(0 == cstrncmp_~n); 15#L545-5true [2018-11-23 01:32:58,925 INFO L796 eck$LassoCheckResult]: Loop: 15#L545-5true cstrncmp_#t~post2 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post2 - 1;cstrncmp_#t~short5 := cstrncmp_#t~post2 > 0; 7#L545-1true assume cstrncmp_#t~short5;call cstrncmp_#t~mem3 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);call cstrncmp_#t~mem4 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1);cstrncmp_#t~short5 := cstrncmp_#t~mem3 == cstrncmp_#t~mem4; 12#L545-3true assume !!cstrncmp_#t~short5;havoc cstrncmp_#t~post2;havoc cstrncmp_#t~mem3;havoc cstrncmp_#t~mem4;havoc cstrncmp_#t~short5;cstrncmp_#t~short7 := 0 == cstrncmp_~n; 5#L546true assume cstrncmp_#t~short7; 8#L546-2true assume !cstrncmp_#t~short7;havoc cstrncmp_#t~short7;havoc cstrncmp_#t~mem6;cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post8.base, 1 + cstrncmp_#t~post8.offset;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, 1 + cstrncmp_#t~post9.offset;havoc cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset; 15#L545-5true [2018-11-23 01:32:58,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:58,929 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 1 times [2018-11-23 01:32:58,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:58,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:58,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:58,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:58,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:32:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:32:59,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:59,050 INFO L82 PathProgramCache]: Analyzing trace with hash 52587176, now seen corresponding path program 1 times [2018-11-23 01:32:59,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:59,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:59,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:59,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:59,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:32:59,091 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-23 01:32:59,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:32:59,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 01:32:59,096 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 01:32:59,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:32:59,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:32:59,110 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-11-23 01:32:59,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:32:59,149 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2018-11-23 01:32:59,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:32:59,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2018-11-23 01:32:59,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 01:32:59,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 11 states and 14 transitions. [2018-11-23 01:32:59,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 01:32:59,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 01:32:59,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-23 01:32:59,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 01:32:59,157 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-23 01:32:59,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-23 01:32:59,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-23 01:32:59,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 01:32:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-23 01:32:59,178 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-23 01:32:59,178 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-23 01:32:59,178 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 01:32:59,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-11-23 01:32:59,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 01:32:59,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:32:59,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:32:59,180 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 01:32:59,180 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 01:32:59,180 INFO L794 eck$LassoCheckResult]: Stem: 51#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 46#L-1 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; 47#L558 assume !(main_~length1~0 < 1); 50#L558-2 assume !(main_~length2~0 < 1); 55#L561-1 call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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; 56#L543 assume !(0 == cstrncmp_~n); 53#L545-5 [2018-11-23 01:32:59,180 INFO L796 eck$LassoCheckResult]: Loop: 53#L545-5 cstrncmp_#t~post2 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post2 - 1;cstrncmp_#t~short5 := cstrncmp_#t~post2 > 0; 54#L545-1 assume cstrncmp_#t~short5;call cstrncmp_#t~mem3 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);call cstrncmp_#t~mem4 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1);cstrncmp_#t~short5 := cstrncmp_#t~mem3 == cstrncmp_#t~mem4; 48#L545-3 assume !!cstrncmp_#t~short5;havoc cstrncmp_#t~post2;havoc cstrncmp_#t~mem3;havoc cstrncmp_#t~mem4;havoc cstrncmp_#t~short5;cstrncmp_#t~short7 := 0 == cstrncmp_~n; 49#L546 assume !cstrncmp_#t~short7;call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~short7 := 0 == cstrncmp_#t~mem6; 52#L546-2 assume !cstrncmp_#t~short7;havoc cstrncmp_#t~short7;havoc cstrncmp_#t~mem6;cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post8.base, 1 + cstrncmp_#t~post8.offset;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, 1 + cstrncmp_#t~post9.offset;havoc cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset; 53#L545-5 [2018-11-23 01:32:59,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:59,180 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 2 times [2018-11-23 01:32:59,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:59,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:59,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:59,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:59,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:32:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:32:59,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:59,210 INFO L82 PathProgramCache]: Analyzing trace with hash 52587238, now seen corresponding path program 1 times [2018-11-23 01:32:59,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:59,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:59,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:59,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:32:59,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:32:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:32:59,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:32:59,231 INFO L82 PathProgramCache]: Analyzing trace with hash -2120298631, now seen corresponding path program 1 times [2018-11-23 01:32:59,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:32:59,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:32:59,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:59,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:32:59,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:32:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:32:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:32:59,508 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2018-11-23 01:32:59,771 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2018-11-23 01:32:59,860 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 01:32:59,861 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 01:32:59,861 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 01:32:59,861 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 01:32:59,862 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 01:32:59,862 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 01:32:59,862 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 01:32:59,862 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 01:32:59,862 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncmp-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-23 01:32:59,862 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 01:32:59,863 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 01:32:59,883 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-23 01:32:59,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:32:59,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 01:32:59,896 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-23 01:32:59,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-23 01:32:59,917 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-23 01:32:59,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-23 01:33:00,140 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2018-11-23 01:33:00,232 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-23 01:33:00,234 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-23 01:33:00,236 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-23 01:33:00,237 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-23 01:33:00,239 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-23 01:33:00,240 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-23 01:33:00,242 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-23 01:33:00,243 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-23 01:33:00,244 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-23 01:33:00,246 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-23 01:33:00,254 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-23 01:33:00,256 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-23 01:33:00,258 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-23 01:33:00,259 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-23 01:33:00,261 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-23 01:33:00,263 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-23 01:33:00,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-23 01:33:00,672 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 01:33:00,677 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 01:33:00,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 01:33:00,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:33:00,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:33:00,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:33:00,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:33:00,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:33:00,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:33:00,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:33:00,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:33:00,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 01:33:00,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:33:00,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:33:00,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:33:00,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:33:00,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:33:00,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:33:00,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:33:00,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:33:00,686 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-23 01:33:00,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:33:00,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:33:00,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:33:00,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:33:00,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:33:00,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:33:00,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:33:00,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:33:00,689 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-23 01:33:00,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:33:00,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:33:00,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:33:00,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:33:00,691 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:33:00,691 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:33:00,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:33:00,694 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-23 01:33:00,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:33:00,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:33:00,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:33:00,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:33:00,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:33:00,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:33:00,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:33:00,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:33:00,696 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-23 01:33:00,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:33:00,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:33:00,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:33:00,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:33:00,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:33:00,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 01:33:00,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:33:00,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:33:00,699 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-23 01:33:00,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:33:00,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 01:33:00,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:33:00,700 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 01:33:00,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:33:00,701 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 01:33:00,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 01:33:00,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:33:00,706 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-23 01:33:00,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:33:00,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:33:00,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:33:00,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:33:00,710 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:33:00,710 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:33:00,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 01:33:00,722 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-23 01:33:00,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 01:33:00,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 01:33:00,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 01:33:00,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 01:33:00,730 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 01:33:00,730 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 01:33:00,786 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 01:33:00,815 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 01:33:00,815 INFO L444 ModelExtractionUtils]: 40 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 01:33:00,817 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 01:33:00,819 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 01:33:00,819 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 01:33:00,820 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc16.base)_1, ULTIMATE.start_cstrncmp_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc16.base)_1 - 1*ULTIMATE.start_cstrncmp_~s1.offset Supporting invariants [] [2018-11-23 01:33:00,865 INFO L297 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2018-11-23 01:33:00,874 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 01:33:00,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:33:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:33:00,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:33:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:33:00,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:33:00,999 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-23 01:33:01,002 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 01:33:01,002 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 5 states. [2018-11-23 01:33:01,053 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 5 states. Result 25 states and 31 transitions. Complement of second has 7 states. [2018-11-23 01:33:01,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 01:33:01,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 01:33:01,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-11-23 01:33:01,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 6 letters. Loop has 5 letters. [2018-11-23 01:33:01,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:33:01,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 5 letters. [2018-11-23 01:33:01,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:33:01,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 6 letters. Loop has 10 letters. [2018-11-23 01:33:01,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 01:33:01,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2018-11-23 01:33:01,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 01:33:01,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 22 states and 27 transitions. [2018-11-23 01:33:01,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-23 01:33:01,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 01:33:01,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2018-11-23 01:33:01,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 01:33:01,067 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-23 01:33:01,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2018-11-23 01:33:01,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 01:33:01,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 01:33:01,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2018-11-23 01:33:01,069 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-11-23 01:33:01,069 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-11-23 01:33:01,069 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 01:33:01,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2018-11-23 01:33:01,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 01:33:01,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:33:01,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:33:01,071 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:33:01,071 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 01:33:01,072 INFO L794 eck$LassoCheckResult]: Stem: 217#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 210#L-1 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; 211#L558 assume !(main_~length1~0 < 1); 216#L558-2 assume !(main_~length2~0 < 1); 224#L561-1 call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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; 226#L543 assume !(0 == cstrncmp_~n); 228#L545-5 cstrncmp_#t~post2 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post2 - 1;cstrncmp_#t~short5 := cstrncmp_#t~post2 > 0; 221#L545-1 [2018-11-23 01:33:01,072 INFO L796 eck$LassoCheckResult]: Loop: 221#L545-1 assume !cstrncmp_#t~short5; 212#L545-3 assume !!cstrncmp_#t~short5;havoc cstrncmp_#t~post2;havoc cstrncmp_#t~mem3;havoc cstrncmp_#t~mem4;havoc cstrncmp_#t~short5;cstrncmp_#t~short7 := 0 == cstrncmp_~n; 213#L546 assume !cstrncmp_#t~short7;call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~short7 := 0 == cstrncmp_#t~mem6; 218#L546-2 assume !cstrncmp_#t~short7;havoc cstrncmp_#t~short7;havoc cstrncmp_#t~mem6;cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post8.base, 1 + cstrncmp_#t~post8.offset;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, 1 + cstrncmp_#t~post9.offset;havoc cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset; 220#L545-5 cstrncmp_#t~post2 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post2 - 1;cstrncmp_#t~short5 := cstrncmp_#t~post2 > 0; 221#L545-1 [2018-11-23 01:33:01,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:33:01,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2018-11-23 01:33:01,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:33:01,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:33:01,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:33:01,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:33:01,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:33:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:33:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:33:01,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:33:01,090 INFO L82 PathProgramCache]: Analyzing trace with hash 57448140, now seen corresponding path program 1 times [2018-11-23 01:33:01,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:33:01,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:33:01,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:33:01,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:33:01,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:33:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:33:01,100 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-23 01:33:01,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:33:01,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 01:33:01,101 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 01:33:01,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:33:01,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:33:01,101 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-23 01:33:01,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:33:01,111 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-11-23 01:33:01,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:33:01,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2018-11-23 01:33:01,112 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 01:33:01,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2018-11-23 01:33:01,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 01:33:01,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 01:33:01,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 01:33:01,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 01:33:01,113 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 01:33:01,113 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 01:33:01,113 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 01:33:01,113 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 01:33:01,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 01:33:01,113 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 01:33:01,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 01:33:01,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 01:33:01 BoogieIcfgContainer [2018-11-23 01:33:01,120 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 01:33:01,120 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:33:01,120 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:33:01,120 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:33:01,121 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:32:58" (3/4) ... [2018-11-23 01:33:01,124 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 01:33:01,124 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:33:01,125 INFO L168 Benchmark]: Toolchain (without parser) took 3020.12 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 242.2 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 58.5 MB. Max. memory is 11.5 GB. [2018-11-23 01:33:01,126 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:33:01,126 INFO L168 Benchmark]: CACSL2BoogieTranslator took 405.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.9 MB). Free memory was 957.5 MB in the beginning and 1.2 GB in the end (delta: -210.9 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2018-11-23 01:33:01,127 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 01:33:01,128 INFO L168 Benchmark]: Boogie Preprocessor took 23.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:33:01,128 INFO L168 Benchmark]: RCFGBuilder took 259.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2018-11-23 01:33:01,129 INFO L168 Benchmark]: BuchiAutomizer took 2289.10 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.2 MB). Peak memory consumption was 62.5 MB. Max. memory is 11.5 GB. [2018-11-23 01:33:01,129 INFO L168 Benchmark]: Witness Printer took 4.41 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:33:01,133 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 405.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.9 MB). Free memory was 957.5 MB in the beginning and 1.2 GB in the end (delta: -210.9 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 259.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2289.10 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.2 MB). Peak memory consumption was 62.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.41 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s1 and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 21 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 49 SDtfs, 14 SDslu, 39 SDs, 0 SdLazy, 19 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital230 mio100 ax100 hnf99 lsp87 ukn85 mio100 lsp47 div100 bol100 ite100 ukn100 eq195 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 1 VariablesLoop: 0 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...