./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrlen-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6d2c9d9f-7573-4736-b4e1-0ab73736549b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6d2c9d9f-7573-4736-b4e1-0ab73736549b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6d2c9d9f-7573-4736-b4e1-0ab73736549b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6d2c9d9f-7573-4736-b4e1-0ab73736549b/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrlen-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6d2c9d9f-7573-4736-b4e1-0ab73736549b/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6d2c9d9f-7573-4736-b4e1-0ab73736549b/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 46ac9a098c7c17e5f63698307929b277c408d664 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 08:13:47,746 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 08:13:47,747 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 08:13:47,753 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 08:13:47,753 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 08:13:47,754 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 08:13:47,754 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 08:13:47,755 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 08:13:47,756 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 08:13:47,756 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 08:13:47,757 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 08:13:47,757 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 08:13:47,757 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 08:13:47,758 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 08:13:47,758 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 08:13:47,759 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 08:13:47,759 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 08:13:47,760 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 08:13:47,761 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 08:13:47,761 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 08:13:47,762 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 08:13:47,763 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 08:13:47,764 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 08:13:47,764 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 08:13:47,764 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 08:13:47,764 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 08:13:47,765 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 08:13:47,765 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 08:13:47,765 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 08:13:47,766 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 08:13:47,766 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 08:13:47,766 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 08:13:47,767 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 08:13:47,767 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 08:13:47,767 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 08:13:47,767 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 08:13:47,768 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6d2c9d9f-7573-4736-b4e1-0ab73736549b/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 08:13:47,775 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 08:13:47,775 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 08:13:47,775 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 08:13:47,775 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 08:13:47,775 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 08:13:47,776 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 08:13:47,776 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 08:13:47,776 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 08:13:47,776 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 08:13:47,776 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 08:13:47,776 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 08:13:47,776 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 08:13:47,776 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 08:13:47,776 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 08:13:47,777 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 08:13:47,777 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 08:13:47,777 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 08:13:47,777 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 08:13:47,777 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 08:13:47,777 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 08:13:47,777 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 08:13:47,777 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 08:13:47,777 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 08:13:47,777 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 08:13:47,777 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 08:13:47,778 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 08:13:47,778 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 08:13:47,778 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 08:13:47,778 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 08:13:47,778 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 08:13:47,778 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 08:13:47,778 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 08:13:47,778 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 08:13:47,778 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 08:13:47,778 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 08:13:47,778 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 08:13:47,778 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_6d2c9d9f-7573-4736-b4e1-0ab73736549b/bin-2019/utaipan 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(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 46ac9a098c7c17e5f63698307929b277c408d664 [2018-12-09 08:13:47,796 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 08:13:47,805 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 08:13:47,808 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 08:13:47,809 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 08:13:47,809 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 08:13:47,810 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6d2c9d9f-7573-4736-b4e1-0ab73736549b/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-12-09 08:13:47,849 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6d2c9d9f-7573-4736-b4e1-0ab73736549b/bin-2019/utaipan/data/a88eedad0/313f94be0869405688142e3147f65db4/FLAG01d78c5be [2018-12-09 08:13:48,295 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 08:13:48,295 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6d2c9d9f-7573-4736-b4e1-0ab73736549b/sv-benchmarks/c/array-memsafety/cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-12-09 08:13:48,302 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6d2c9d9f-7573-4736-b4e1-0ab73736549b/bin-2019/utaipan/data/a88eedad0/313f94be0869405688142e3147f65db4/FLAG01d78c5be [2018-12-09 08:13:48,310 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6d2c9d9f-7573-4736-b4e1-0ab73736549b/bin-2019/utaipan/data/a88eedad0/313f94be0869405688142e3147f65db4 [2018-12-09 08:13:48,312 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 08:13:48,313 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 08:13:48,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 08:13:48,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 08:13:48,315 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 08:13:48,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:13:48" (1/1) ... [2018-12-09 08:13:48,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e7a4aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:48, skipping insertion in model container [2018-12-09 08:13:48,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:13:48" (1/1) ... [2018-12-09 08:13:48,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 08:13:48,340 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 08:13:48,476 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 08:13:48,482 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 08:13:48,537 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 08:13:48,556 INFO L195 MainTranslator]: Completed translation [2018-12-09 08:13:48,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:48 WrapperNode [2018-12-09 08:13:48,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 08:13:48,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 08:13:48,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 08:13:48,557 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 08:13:48,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:48" (1/1) ... [2018-12-09 08:13:48,569 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:48" (1/1) ... [2018-12-09 08:13:48,573 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 08:13:48,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 08:13:48,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 08:13:48,574 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 08:13:48,579 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:48" (1/1) ... [2018-12-09 08:13:48,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:48" (1/1) ... [2018-12-09 08:13:48,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:48" (1/1) ... [2018-12-09 08:13:48,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:48" (1/1) ... [2018-12-09 08:13:48,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:48" (1/1) ... [2018-12-09 08:13:48,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:48" (1/1) ... [2018-12-09 08:13:48,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:48" (1/1) ... [2018-12-09 08:13:48,588 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 08:13:48,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 08:13:48,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 08:13:48,588 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 08:13:48,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6d2c9d9f-7573-4736-b4e1-0ab73736549b/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 08:13:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 08:13:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 08:13:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 08:13:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 08:13:48,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 08:13:48,621 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 08:13:48,621 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 08:13:48,621 INFO L130 BoogieDeclarations]: Found specification of procedure cstrlen [2018-12-09 08:13:48,621 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-12-09 08:13:48,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 08:13:48,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 08:13:48,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 08:13:48,736 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 08:13:48,736 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 08:13:48,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:13:48 BoogieIcfgContainer [2018-12-09 08:13:48,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 08:13:48,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 08:13:48,737 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 08:13:48,738 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 08:13:48,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 08:13:48" (1/3) ... [2018-12-09 08:13:48,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cdab9d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:13:48, skipping insertion in model container [2018-12-09 08:13:48,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:13:48" (2/3) ... [2018-12-09 08:13:48,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cdab9d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:13:48, skipping insertion in model container [2018-12-09 08:13:48,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:13:48" (3/3) ... [2018-12-09 08:13:48,740 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-12-09 08:13:48,746 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 08:13:48,750 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-12-09 08:13:48,759 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2018-12-09 08:13:48,773 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 08:13:48,773 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 08:13:48,773 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 08:13:48,773 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 08:13:48,774 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 08:13:48,774 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 08:13:48,774 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 08:13:48,774 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 08:13:48,781 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-12-09 08:13:48,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 08:13:48,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:13:48,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:13:48,788 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 08:13:48,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:48,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1881386188, now seen corresponding path program 1 times [2018-12-09 08:13:48,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:13:48,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:48,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:13:48,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:48,823 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:13:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:13:48,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:13:48,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:13:48,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 08:13:48,883 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:13:48,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 08:13:48,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 08:13:48,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 08:13:48,895 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2018-12-09 08:13:48,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:13:48,918 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-12-09 08:13:48,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 08:13:48,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-09 08:13:48,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:13:48,924 INFO L225 Difference]: With dead ends: 25 [2018-12-09 08:13:48,924 INFO L226 Difference]: Without dead ends: 22 [2018-12-09 08:13:48,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 08:13:48,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-09 08:13:48,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-09 08:13:48,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-09 08:13:48,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-12-09 08:13:48,945 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 9 [2018-12-09 08:13:48,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:13:48,946 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-12-09 08:13:48,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 08:13:48,946 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-12-09 08:13:48,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 08:13:48,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:13:48,946 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:13:48,946 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 08:13:48,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:48,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1881386189, now seen corresponding path program 1 times [2018-12-09 08:13:48,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:13:48,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:48,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:13:48,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:48,947 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:13:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:13:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:13:48,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:13:48,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 08:13:48,981 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:13:48,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 08:13:48,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 08:13:48,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:13:48,983 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 4 states. [2018-12-09 08:13:48,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:13:48,997 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-12-09 08:13:48,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 08:13:48,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-12-09 08:13:48,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:13:48,998 INFO L225 Difference]: With dead ends: 21 [2018-12-09 08:13:48,998 INFO L226 Difference]: Without dead ends: 21 [2018-12-09 08:13:48,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:13:48,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-09 08:13:49,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-09 08:13:49,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-09 08:13:49,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-09 08:13:49,001 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 9 [2018-12-09 08:13:49,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:13:49,001 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-09 08:13:49,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 08:13:49,001 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-09 08:13:49,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 08:13:49,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:13:49,002 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:13:49,002 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 08:13:49,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:49,002 INFO L82 PathProgramCache]: Analyzing trace with hash -947275451, now seen corresponding path program 1 times [2018-12-09 08:13:49,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:13:49,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:49,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:13:49,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:49,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:13:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:13:49,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:13:49,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:13:49,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 08:13:49,041 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:13:49,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 08:13:49,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 08:13:49,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 08:13:49,042 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2018-12-09 08:13:49,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:13:49,078 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-12-09 08:13:49,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 08:13:49,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-12-09 08:13:49,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:13:49,079 INFO L225 Difference]: With dead ends: 20 [2018-12-09 08:13:49,079 INFO L226 Difference]: Without dead ends: 20 [2018-12-09 08:13:49,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 08:13:49,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-09 08:13:49,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-09 08:13:49,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-09 08:13:49,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-12-09 08:13:49,081 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 12 [2018-12-09 08:13:49,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:13:49,081 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-12-09 08:13:49,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 08:13:49,081 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-12-09 08:13:49,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 08:13:49,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:13:49,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:13:49,081 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 08:13:49,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:49,082 INFO L82 PathProgramCache]: Analyzing trace with hash -947275450, now seen corresponding path program 1 times [2018-12-09 08:13:49,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:13:49,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:49,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:13:49,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:49,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:13:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:13:49,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:13:49,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:13:49,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 08:13:49,129 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:13:49,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 08:13:49,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 08:13:49,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 08:13:49,130 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 7 states. [2018-12-09 08:13:49,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:13:49,164 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-12-09 08:13:49,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 08:13:49,165 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-12-09 08:13:49,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:13:49,167 INFO L225 Difference]: With dead ends: 25 [2018-12-09 08:13:49,167 INFO L226 Difference]: Without dead ends: 25 [2018-12-09 08:13:49,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 08:13:49,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-09 08:13:49,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-12-09 08:13:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-09 08:13:49,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-09 08:13:49,171 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 12 [2018-12-09 08:13:49,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:13:49,172 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-09 08:13:49,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 08:13:49,172 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-09 08:13:49,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 08:13:49,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:13:49,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:13:49,173 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 08:13:49,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:49,173 INFO L82 PathProgramCache]: Analyzing trace with hash 201357823, now seen corresponding path program 1 times [2018-12-09 08:13:49,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:13:49,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:49,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:13:49,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:49,174 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:13:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:13:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:13:49,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:13:49,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 08:13:49,255 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:13:49,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 08:13:49,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 08:13:49,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 08:13:49,256 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 8 states. [2018-12-09 08:13:49,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:13:49,305 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-09 08:13:49,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 08:13:49,305 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-12-09 08:13:49,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:13:49,306 INFO L225 Difference]: With dead ends: 33 [2018-12-09 08:13:49,306 INFO L226 Difference]: Without dead ends: 33 [2018-12-09 08:13:49,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-09 08:13:49,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-09 08:13:49,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-12-09 08:13:49,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 08:13:49,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-12-09 08:13:49,309 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 14 [2018-12-09 08:13:49,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:13:49,309 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-12-09 08:13:49,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 08:13:49,309 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-09 08:13:49,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 08:13:49,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:13:49,310 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:13:49,310 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 08:13:49,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:49,310 INFO L82 PathProgramCache]: Analyzing trace with hash -607988803, now seen corresponding path program 1 times [2018-12-09 08:13:49,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:13:49,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:49,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:13:49,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:49,311 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:13:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:13:49,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:13:49,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:13:49,411 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 08:13:49,412 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-12-09 08:13:49,413 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [7], [9], [14], [23], [28], [30], [31], [38], [39], [40], [42] [2018-12-09 08:13:49,435 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 08:13:49,435 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 08:13:49,539 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 08:13:49,540 INFO L272 AbstractInterpreter]: Visited 14 different actions 20 times. Merged at 3 different actions 6 times. Never widened. Performed 158 root evaluator evaluations with a maximum evaluation depth of 3. Performed 158 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 19 variables. [2018-12-09 08:13:49,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:49,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 08:13:49,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:13:49,548 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6d2c9d9f-7573-4736-b4e1-0ab73736549b/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 08:13:49,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:13:49,554 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 08:13:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:13:49,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:13:49,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 08:13:49,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 08:13:49,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:13:49,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:13:49,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:13:49,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 08:13:49,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-12-09 08:13:49,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 08:13:49,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 08:13:49,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:13:49,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:13:49,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-12-09 08:13:49,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:13:49,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:13:49,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-09 08:13:49,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 08:13:49,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-09 08:13:49,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-09 08:13:49,844 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 08:13:49,845 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:13:49,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:13:49,850 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-12-09 08:13:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:13:49,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 08:13:49,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2018-12-09 08:13:49,871 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 08:13:49,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 08:13:49,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 08:13:49,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-12-09 08:13:49,872 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 13 states. [2018-12-09 08:13:50,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:13:50,530 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-12-09 08:13:50,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 08:13:50,531 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-12-09 08:13:50,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:13:50,531 INFO L225 Difference]: With dead ends: 39 [2018-12-09 08:13:50,531 INFO L226 Difference]: Without dead ends: 39 [2018-12-09 08:13:50,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2018-12-09 08:13:50,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-09 08:13:50,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2018-12-09 08:13:50,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-09 08:13:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-12-09 08:13:50,534 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 14 [2018-12-09 08:13:50,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:13:50,534 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-12-09 08:13:50,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 08:13:50,535 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-12-09 08:13:50,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 08:13:50,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:13:50,535 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:13:50,536 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 08:13:50,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:50,536 INFO L82 PathProgramCache]: Analyzing trace with hash -161688906, now seen corresponding path program 2 times [2018-12-09 08:13:50,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:13:50,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:50,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:13:50,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:50,537 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:13:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:13:50,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:13:50,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:13:50,668 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 08:13:50,668 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 08:13:50,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 08:13:50,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:13:50,668 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6d2c9d9f-7573-4736-b4e1-0ab73736549b/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 08:13:50,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 08:13:50,674 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 08:13:50,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 08:13:50,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 08:13:50,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:13:50,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 08:13:50,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 08:13:50,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:13:50,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 08:13:50,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 08:13:50,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-09 08:13:50,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:13:50,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:13:50,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:13:50,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-09 08:13:50,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-09 08:13:50,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 08:13:50,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 08:13:50,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:13:50,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:13:50,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-12-09 08:13:50,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:13:50,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:13:50,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2018-12-09 08:13:51,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-09 08:13:51,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:13:51,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:13:51,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2018-12-09 08:13:51,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-09 08:13:51,033 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:13:51,038 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:13:51,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:13:51,053 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:98 [2018-12-09 08:13:51,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:13:51,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 08:13:51,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2018-12-09 08:13:51,119 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 08:13:51,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 08:13:51,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 08:13:51,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-12-09 08:13:51,120 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 15 states. [2018-12-09 08:13:51,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:13:51,421 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-12-09 08:13:51,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 08:13:51,421 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-12-09 08:13:51,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:13:51,421 INFO L225 Difference]: With dead ends: 38 [2018-12-09 08:13:51,422 INFO L226 Difference]: Without dead ends: 38 [2018-12-09 08:13:51,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2018-12-09 08:13:51,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-09 08:13:51,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-12-09 08:13:51,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-09 08:13:51,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-12-09 08:13:51,424 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 16 [2018-12-09 08:13:51,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:13:51,425 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-12-09 08:13:51,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 08:13:51,425 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-12-09 08:13:51,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 08:13:51,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:13:51,425 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:13:51,425 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 08:13:51,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:13:51,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1069298268, now seen corresponding path program 1 times [2018-12-09 08:13:51,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:13:51,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:51,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:13:51,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:13:51,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:13:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:13:51,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:13:51,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:13:51,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 08:13:51,452 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:13:51,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 08:13:51,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 08:13:51,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:13:51,453 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 4 states. [2018-12-09 08:13:51,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:13:51,468 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-12-09 08:13:51,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 08:13:51,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-09 08:13:51,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:13:51,468 INFO L225 Difference]: With dead ends: 27 [2018-12-09 08:13:51,468 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 08:13:51,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:13:51,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 08:13:51,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 08:13:51,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 08:13:51,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 08:13:51,469 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-12-09 08:13:51,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:13:51,469 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 08:13:51,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 08:13:51,469 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 08:13:51,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 08:13:51,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 08:13:51 BoogieIcfgContainer [2018-12-09 08:13:51,472 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 08:13:51,472 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 08:13:51,472 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 08:13:51,472 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 08:13:51,473 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:13:48" (3/4) ... [2018-12-09 08:13:51,475 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 08:13:51,478 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 08:13:51,478 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrlen [2018-12-09 08:13:51,478 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 08:13:51,480 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-12-09 08:13:51,481 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-09 08:13:51,481 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 08:13:51,503 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6d2c9d9f-7573-4736-b4e1-0ab73736549b/bin-2019/utaipan/witness.graphml [2018-12-09 08:13:51,503 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 08:13:51,504 INFO L168 Benchmark]: Toolchain (without parser) took 3191.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -107.0 MB). Peak memory consumption was 104.8 MB. Max. memory is 11.5 GB. [2018-12-09 08:13:51,504 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 08:13:51,505 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-09 08:13:51,505 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 08:13:51,505 INFO L168 Benchmark]: Boogie Preprocessor took 14.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 08:13:51,505 INFO L168 Benchmark]: RCFGBuilder took 147.90 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: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-12-09 08:13:51,505 INFO L168 Benchmark]: TraceAbstraction took 2735.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.5 MB). Peak memory consumption was 123.4 MB. Max. memory is 11.5 GB. [2018-12-09 08:13:51,505 INFO L168 Benchmark]: Witness Printer took 30.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 08:13:51,507 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 243.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 147.90 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: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2735.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.5 MB). Peak memory consumption was 123.4 MB. Max. memory is 11.5 GB. * Witness Printer took 30.95 ms. Allocated memory is still 1.2 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.traceabstraction: - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 553]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 5 error locations. SAFE Result, 2.7s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 128 SDtfs, 169 SDslu, 396 SDs, 0 SdLazy, 396 SolverSat, 71 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 24 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 152 ConstructedInterpolants, 13 QuantifiedInterpolants, 16372 SizeOfPredicates, 22 NumberOfNonLiveVariables, 159 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 2/16 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...