./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrncmp-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_4bef79a3-8c12-4514-93f3-a8502bb6d3b3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4bef79a3-8c12-4514-93f3-a8502bb6d3b3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4bef79a3-8c12-4514-93f3-a8502bb6d3b3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4bef79a3-8c12-4514-93f3-a8502bb6d3b3/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4bef79a3-8c12-4514-93f3-a8502bb6d3b3/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4bef79a3-8c12-4514-93f3-a8502bb6d3b3/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 60847b137b78d6fc8305d5c5fcc8bf5228130e36 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 06:00:20,614 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 06:00:20,615 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 06:00:20,622 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 06:00:20,623 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 06:00:20,623 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 06:00:20,624 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 06:00:20,625 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 06:00:20,626 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 06:00:20,627 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 06:00:20,627 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 06:00:20,627 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 06:00:20,628 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 06:00:20,629 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 06:00:20,629 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 06:00:20,630 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 06:00:20,630 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 06:00:20,631 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 06:00:20,633 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 06:00:20,634 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 06:00:20,634 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 06:00:20,635 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 06:00:20,637 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 06:00:20,637 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 06:00:20,637 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 06:00:20,638 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 06:00:20,638 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 06:00:20,639 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 06:00:20,639 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 06:00:20,640 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 06:00:20,640 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 06:00:20,641 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 06:00:20,641 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 06:00:20,641 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 06:00:20,642 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 06:00:20,642 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 06:00:20,642 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4bef79a3-8c12-4514-93f3-a8502bb6d3b3/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-03 06:00:20,652 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 06:00:20,652 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 06:00:20,653 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 06:00:20,653 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 06:00:20,653 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 06:00:20,654 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 06:00:20,654 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 06:00:20,654 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 06:00:20,654 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 06:00:20,654 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 06:00:20,654 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 06:00:20,654 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 06:00:20,654 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 06:00:20,655 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 06:00:20,655 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 06:00:20,655 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 06:00:20,655 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 06:00:20,655 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-03 06:00:20,655 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 06:00:20,656 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 06:00:20,656 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 06:00:20,656 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-03 06:00:20,656 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-03 06:00:20,656 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-03 06:00:20,656 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 06:00:20,656 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 06:00:20,656 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 06:00:20,656 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 06:00:20,657 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 06:00:20,657 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 06:00:20,657 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 06:00:20,657 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 06:00:20,657 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 06:00:20,657 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 06:00:20,657 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 06:00:20,657 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 06:00:20,657 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_4bef79a3-8c12-4514-93f3-a8502bb6d3b3/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 -> 60847b137b78d6fc8305d5c5fcc8bf5228130e36 [2018-12-03 06:00:20,679 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 06:00:20,689 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 06:00:20,691 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 06:00:20,692 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 06:00:20,693 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 06:00:20,693 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4bef79a3-8c12-4514-93f3-a8502bb6d3b3/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-12-03 06:00:20,735 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4bef79a3-8c12-4514-93f3-a8502bb6d3b3/bin-2019/utaipan/data/129cdc257/19b3067732ca4b1ab5c10f781f5c2e3a/FLAG9ce854647 [2018-12-03 06:00:21,157 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 06:00:21,157 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4bef79a3-8c12-4514-93f3-a8502bb6d3b3/sv-benchmarks/c/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-12-03 06:00:21,163 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4bef79a3-8c12-4514-93f3-a8502bb6d3b3/bin-2019/utaipan/data/129cdc257/19b3067732ca4b1ab5c10f781f5c2e3a/FLAG9ce854647 [2018-12-03 06:00:21,171 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4bef79a3-8c12-4514-93f3-a8502bb6d3b3/bin-2019/utaipan/data/129cdc257/19b3067732ca4b1ab5c10f781f5c2e3a [2018-12-03 06:00:21,173 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 06:00:21,174 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 06:00:21,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 06:00:21,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 06:00:21,176 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 06:00:21,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 06:00:21" (1/1) ... [2018-12-03 06:00:21,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23ef7631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:00:21, skipping insertion in model container [2018-12-03 06:00:21,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 06:00:21" (1/1) ... [2018-12-03 06:00:21,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 06:00:21,200 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 06:00:21,341 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 06:00:21,382 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 06:00:21,403 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 06:00:21,422 INFO L195 MainTranslator]: Completed translation [2018-12-03 06:00:21,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:00:21 WrapperNode [2018-12-03 06:00:21,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 06:00:21,423 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 06:00:21,423 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 06:00:21,423 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 06:00:21,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:00:21" (1/1) ... [2018-12-03 06:00:21,436 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:00:21" (1/1) ... [2018-12-03 06:00:21,441 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 06:00:21,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 06:00:21,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 06:00:21,441 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 06:00:21,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:00:21" (1/1) ... [2018-12-03 06:00:21,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:00:21" (1/1) ... [2018-12-03 06:00:21,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:00:21" (1/1) ... [2018-12-03 06:00:21,449 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:00:21" (1/1) ... [2018-12-03 06:00:21,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:00:21" (1/1) ... [2018-12-03 06:00:21,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:00:21" (1/1) ... [2018-12-03 06:00:21,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:00:21" (1/1) ... [2018-12-03 06:00:21,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 06:00:21,458 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 06:00:21,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 06:00:21,458 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 06:00:21,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:00:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4bef79a3-8c12-4514-93f3-a8502bb6d3b3/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-03 06:00:21,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 06:00:21,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-03 06:00:21,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 06:00:21,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 06:00:21,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 06:00:21,489 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 06:00:21,489 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 06:00:21,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 06:00:21,489 INFO L130 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-12-03 06:00:21,489 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-12-03 06:00:21,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 06:00:21,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 06:00:21,666 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 06:00:21,667 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 06:00:21,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:00:21 BoogieIcfgContainer [2018-12-03 06:00:21,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 06:00:21,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 06:00:21,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 06:00:21,669 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 06:00:21,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 06:00:21" (1/3) ... [2018-12-03 06:00:21,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7b0710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:00:21, skipping insertion in model container [2018-12-03 06:00:21,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:00:21" (2/3) ... [2018-12-03 06:00:21,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7b0710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:00:21, skipping insertion in model container [2018-12-03 06:00:21,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:00:21" (3/3) ... [2018-12-03 06:00:21,671 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-12-03 06:00:21,676 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 06:00:21,681 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-03 06:00:21,689 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-03 06:00:21,704 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 06:00:21,704 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-03 06:00:21,705 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 06:00:21,705 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 06:00:21,705 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 06:00:21,705 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 06:00:21,705 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 06:00:21,705 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 06:00:21,714 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-12-03 06:00:21,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 06:00:21,719 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:00:21,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:00:21,721 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-03 06:00:21,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:00:21,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1956342163, now seen corresponding path program 1 times [2018-12-03 06:00:21,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:00:21,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:21,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:00:21,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:21,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:00:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:00:21,833 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-03 06:00:21,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:00:21,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 06:00:21,835 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:00:21,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:00:21,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:00:21,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:00:21,847 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2018-12-03 06:00:21,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:00:21,881 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-12-03 06:00:21,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:00:21,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-03 06:00:21,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:00:21,888 INFO L225 Difference]: With dead ends: 52 [2018-12-03 06:00:21,888 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 06:00:21,889 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-03 06:00:21,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 06:00:21,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 06:00:21,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 06:00:21,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-12-03 06:00:21,910 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 10 [2018-12-03 06:00:21,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:00:21,911 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-12-03 06:00:21,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:00:21,911 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-12-03 06:00:21,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 06:00:21,911 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:00:21,911 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:00:21,911 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-03 06:00:21,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:00:21,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1956342164, now seen corresponding path program 1 times [2018-12-03 06:00:21,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:00:21,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:21,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:00:21,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:21,913 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:00:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:00:21,945 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-03 06:00:21,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:00:21,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:00:21,946 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:00:21,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:00:21,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:00:21,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:00:21,947 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 4 states. [2018-12-03 06:00:21,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:00:21,961 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-12-03 06:00:21,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 06:00:21,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-03 06:00:21,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:00:21,962 INFO L225 Difference]: With dead ends: 48 [2018-12-03 06:00:21,962 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 06:00:21,963 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-03 06:00:21,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 06:00:21,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 06:00:21,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 06:00:21,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-12-03 06:00:21,966 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 10 [2018-12-03 06:00:21,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:00:21,966 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-12-03 06:00:21,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:00:21,966 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-12-03 06:00:21,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 06:00:21,966 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:00:21,966 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:00:21,967 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-03 06:00:21,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:00:21,967 INFO L82 PathProgramCache]: Analyzing trace with hash 517064901, now seen corresponding path program 1 times [2018-12-03 06:00:21,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:00:21,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:21,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:00:21,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:21,968 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:00:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:00:21,991 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-03 06:00:21,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:00:21,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 06:00:21,991 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:00:21,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:00:21,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:00:21,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:00:21,991 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 3 states. [2018-12-03 06:00:22,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:00:22,009 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-12-03 06:00:22,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:00:22,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-03 06:00:22,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:00:22,010 INFO L225 Difference]: With dead ends: 47 [2018-12-03 06:00:22,010 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 06:00:22,010 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-03 06:00:22,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 06:00:22,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 06:00:22,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 06:00:22,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-12-03 06:00:22,012 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 11 [2018-12-03 06:00:22,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:00:22,013 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-12-03 06:00:22,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:00:22,013 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-12-03 06:00:22,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 06:00:22,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:00:22,013 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:00:22,013 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-03 06:00:22,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:00:22,013 INFO L82 PathProgramCache]: Analyzing trace with hash 517064902, now seen corresponding path program 1 times [2018-12-03 06:00:22,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:00:22,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:22,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:00:22,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:22,014 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:00:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:00:22,040 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-03 06:00:22,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:00:22,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:00:22,040 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:00:22,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:00:22,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:00:22,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:00:22,041 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 4 states. [2018-12-03 06:00:22,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:00:22,050 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-12-03 06:00:22,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 06:00:22,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-03 06:00:22,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:00:22,051 INFO L225 Difference]: With dead ends: 46 [2018-12-03 06:00:22,051 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 06:00:22,051 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-03 06:00:22,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 06:00:22,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 06:00:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 06:00:22,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-12-03 06:00:22,054 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 11 [2018-12-03 06:00:22,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:00:22,054 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-12-03 06:00:22,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:00:22,054 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-12-03 06:00:22,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 06:00:22,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:00:22,054 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-03 06:00:22,054 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-03 06:00:22,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:00:22,055 INFO L82 PathProgramCache]: Analyzing trace with hash 97684603, now seen corresponding path program 1 times [2018-12-03 06:00:22,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:00:22,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:22,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:00:22,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:22,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:00:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:00:22,081 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-03 06:00:22,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:00:22,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:00:22,081 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:00:22,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:00:22,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:00:22,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:00:22,082 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 5 states. [2018-12-03 06:00:22,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:00:22,129 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-12-03 06:00:22,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 06:00:22,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-03 06:00:22,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:00:22,130 INFO L225 Difference]: With dead ends: 43 [2018-12-03 06:00:22,130 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 06:00:22,130 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-03 06:00:22,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 06:00:22,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 06:00:22,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 06:00:22,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-12-03 06:00:22,133 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 18 [2018-12-03 06:00:22,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:00:22,133 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-12-03 06:00:22,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:00:22,133 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2018-12-03 06:00:22,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 06:00:22,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:00:22,133 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-03 06:00:22,133 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-03 06:00:22,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:00:22,134 INFO L82 PathProgramCache]: Analyzing trace with hash 97684604, now seen corresponding path program 1 times [2018-12-03 06:00:22,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:00:22,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:22,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:00:22,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:22,134 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:00:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:00:22,207 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-03 06:00:22,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:00:22,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:00:22,208 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:00:22,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:00:22,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:00:22,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:00:22,209 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 7 states. [2018-12-03 06:00:22,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:00:22,267 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2018-12-03 06:00:22,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 06:00:22,267 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-12-03 06:00:22,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:00:22,269 INFO L225 Difference]: With dead ends: 65 [2018-12-03 06:00:22,269 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 06:00:22,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-03 06:00:22,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 06:00:22,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2018-12-03 06:00:22,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 06:00:22,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2018-12-03 06:00:22,273 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 18 [2018-12-03 06:00:22,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:00:22,273 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2018-12-03 06:00:22,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:00:22,273 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2018-12-03 06:00:22,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 06:00:22,273 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:00:22,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:00:22,274 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-03 06:00:22,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:00:22,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1266097387, now seen corresponding path program 1 times [2018-12-03 06:00:22,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:00:22,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:22,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:00:22,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:22,275 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:00:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:00:22,305 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-03 06:00:22,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:00:22,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:00:22,306 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:00:22,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:00:22,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:00:22,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:00:22,306 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand 4 states. [2018-12-03 06:00:22,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:00:22,348 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2018-12-03 06:00:22,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 06:00:22,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-12-03 06:00:22,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:00:22,349 INFO L225 Difference]: With dead ends: 51 [2018-12-03 06:00:22,349 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 06:00:22,349 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-03 06:00:22,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 06:00:22,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 06:00:22,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 06:00:22,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-12-03 06:00:22,352 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 19 [2018-12-03 06:00:22,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:00:22,352 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-12-03 06:00:22,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:00:22,352 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-12-03 06:00:22,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 06:00:22,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:00:22,353 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:00:22,353 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-03 06:00:22,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:00:22,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1266744586, now seen corresponding path program 1 times [2018-12-03 06:00:22,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:00:22,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:22,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:00:22,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:22,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:00:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:00:22,395 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-03 06:00:22,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:00:22,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:00:22,395 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:00:22,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:00:22,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:00:22,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:00:22,396 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 7 states. [2018-12-03 06:00:22,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:00:22,439 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-12-03 06:00:22,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 06:00:22,439 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-12-03 06:00:22,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:00:22,440 INFO L225 Difference]: With dead ends: 50 [2018-12-03 06:00:22,440 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 06:00:22,441 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-03 06:00:22,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 06:00:22,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-12-03 06:00:22,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 06:00:22,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-12-03 06:00:22,443 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 19 [2018-12-03 06:00:22,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:00:22,443 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-12-03 06:00:22,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:00:22,443 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-12-03 06:00:22,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 06:00:22,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:00:22,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:00:22,444 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-03 06:00:22,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:00:22,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1266744587, now seen corresponding path program 1 times [2018-12-03 06:00:22,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:00:22,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:22,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:00:22,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:22,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:00:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:00:22,466 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-03 06:00:22,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:00:22,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:00:22,466 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:00:22,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:00:22,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:00:22,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:00:22,467 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 5 states. [2018-12-03 06:00:22,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:00:22,489 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-12-03 06:00:22,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 06:00:22,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-03 06:00:22,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:00:22,490 INFO L225 Difference]: With dead ends: 44 [2018-12-03 06:00:22,490 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 06:00:22,490 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-03 06:00:22,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 06:00:22,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 06:00:22,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 06:00:22,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-12-03 06:00:22,492 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 19 [2018-12-03 06:00:22,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:00:22,493 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-12-03 06:00:22,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:00:22,493 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-12-03 06:00:22,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 06:00:22,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:00:22,494 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:00:22,494 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-03 06:00:22,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:00:22,494 INFO L82 PathProgramCache]: Analyzing trace with hash 2071887360, now seen corresponding path program 1 times [2018-12-03 06:00:22,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:00:22,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:22,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:00:22,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:22,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:00:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:00:22,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:00:22,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:00:22,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:00:22,508 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:00:22,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:00:22,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:00:22,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:00:22,509 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2018-12-03 06:00:22,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:00:22,513 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-12-03 06:00:22,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:00:22,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-03 06:00:22,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:00:22,514 INFO L225 Difference]: With dead ends: 43 [2018-12-03 06:00:22,514 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 06:00:22,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-03 06:00:22,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 06:00:22,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 06:00:22,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 06:00:22,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-12-03 06:00:22,516 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 23 [2018-12-03 06:00:22,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:00:22,516 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-12-03 06:00:22,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:00:22,517 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-12-03 06:00:22,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 06:00:22,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:00:22,517 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:00:22,517 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-03 06:00:22,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:00:22,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1482519971, now seen corresponding path program 1 times [2018-12-03 06:00:22,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:00:22,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:22,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:00:22,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:22,518 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:00:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:00:22,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:00:22,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:00:22,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:00:22,532 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:00:22,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:00:22,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:00:22,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:00:22,532 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 3 states. [2018-12-03 06:00:22,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:00:22,536 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-12-03 06:00:22,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:00:22,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-03 06:00:22,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:00:22,537 INFO L225 Difference]: With dead ends: 43 [2018-12-03 06:00:22,537 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 06:00:22,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-03 06:00:22,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 06:00:22,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 06:00:22,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 06:00:22,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-12-03 06:00:22,539 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 26 [2018-12-03 06:00:22,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:00:22,539 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-12-03 06:00:22,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:00:22,539 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-12-03 06:00:22,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 06:00:22,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:00:22,540 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:00:22,540 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-03 06:00:22,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:00:22,540 INFO L82 PathProgramCache]: Analyzing trace with hash 344318600, now seen corresponding path program 1 times [2018-12-03 06:00:22,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:00:22,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:22,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:00:22,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:22,541 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:00:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:00:22,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:00:22,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:00:22,949 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 06:00:22,949 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-12-03 06:00:22,950 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [8], [16], [18], [19], [22], [25], [30], [34], [39], [42], [43], [45], [46], [49], [57], [62], [63], [66], [71], [91], [92], [93], [95] [2018-12-03 06:00:22,970 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 06:00:22,970 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 06:00:23,065 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 06:00:23,066 INFO L272 AbstractInterpreter]: Visited 26 different actions 26 times. Never merged. Never widened. Performed 204 root evaluator evaluations with a maximum evaluation depth of 3. Performed 204 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-12-03 06:00:23,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:00:23,075 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 06:00:23,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:00:23,075 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4bef79a3-8c12-4514-93f3-a8502bb6d3b3/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-03 06:00:23,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:00:23,081 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 06:00:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:00:23,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:00:23,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 06:00:23,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:00:23,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:00:23,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-03 06:00:23,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-03 06:00:23,185 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-03 06:00:23,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:00:23,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:00:23,192 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-03 06:00:23,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-03 06:00:23,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-12-03 06:00:23,228 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-03 06:00:23,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:00:23,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:00:23,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-03 06:00:23,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:35, output treesize:31 [2018-12-03 06:00:23,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-12-03 06:00:23,349 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 06:00:23,350 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 0 case distinctions, treesize of input 14 treesize of output 10 [2018-12-03 06:00:23,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:00:23,355 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-03 06:00:23,355 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 06:00:23,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:00:23,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:00:23,361 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:38, output treesize:3 [2018-12-03 06:00:23,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:00:23,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:00:23,497 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-03 06:00:23,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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-03 06:00:23,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:00:23,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:00:23,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:00:23,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:3 [2018-12-03 06:00:23,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:00:23,525 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 06:00:23,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 8] imperfect sequences [14] total 25 [2018-12-03 06:00:23,526 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:00:23,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 06:00:23,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 06:00:23,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2018-12-03 06:00:23,526 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 10 states. [2018-12-03 06:00:23,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:00:23,718 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-12-03 06:00:23,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 06:00:23,719 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-12-03 06:00:23,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:00:23,719 INFO L225 Difference]: With dead ends: 60 [2018-12-03 06:00:23,719 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 06:00:23,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2018-12-03 06:00:23,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 06:00:23,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 06:00:23,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 06:00:23,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-12-03 06:00:23,721 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 28 [2018-12-03 06:00:23,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:00:23,721 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-12-03 06:00:23,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 06:00:23,722 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-12-03 06:00:23,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 06:00:23,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:00:23,722 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:00:23,722 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-03 06:00:23,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:00:23,723 INFO L82 PathProgramCache]: Analyzing trace with hash 563173318, now seen corresponding path program 1 times [2018-12-03 06:00:23,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:00:23,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:23,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:00:23,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:23,723 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:00:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:00:24,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:00:24,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:00:24,017 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 06:00:24,017 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-12-03 06:00:24,017 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [22], [25], [30], [34], [39], [42], [43], [45], [46], [49], [57], [62], [63], [66], [71], [91], [92], [93], [95] [2018-12-03 06:00:24,018 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 06:00:24,018 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 06:00:24,054 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 06:00:24,054 INFO L272 AbstractInterpreter]: Visited 26 different actions 26 times. Never merged. Never widened. Performed 202 root evaluator evaluations with a maximum evaluation depth of 3. Performed 202 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-12-03 06:00:24,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:00:24,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 06:00:24,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:00:24,055 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4bef79a3-8c12-4514-93f3-a8502bb6d3b3/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-03 06:00:24,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:00:24,067 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 06:00:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:00:24,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:00:24,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 06:00:24,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:00:24,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:00:24,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-03 06:00:24,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-03 06:00:24,113 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-03 06:00:24,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:00:24,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:00:24,119 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-03 06:00:24,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-12-03 06:00:24,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-12-03 06:00:24,150 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-03 06:00:24,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:00:24,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:00:24,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-03 06:00:24,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-12-03 06:00:24,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-12-03 06:00:24,318 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-03 06:00:24,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 06:00:24,324 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-03 06:00:24,325 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 06:00:24,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 06:00:24,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 06:00:24,336 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-12-03 06:00:24,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:00:24,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:00:24,682 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-03 06:00:24,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:00:24,687 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-03 06:00:24,696 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-03 06:00:24,696 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 06:00:24,697 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:00:24,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:00:24,701 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-12-03 06:00:24,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:00:24,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 06:00:24,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 9] total 30 [2018-12-03 06:00:24,721 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 06:00:24,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 06:00:24,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 06:00:24,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2018-12-03 06:00:24,722 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 24 states. [2018-12-03 06:00:25,216 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2018-12-03 06:00:25,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:00:25,618 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-12-03 06:00:25,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 06:00:25,620 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2018-12-03 06:00:25,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:00:25,621 INFO L225 Difference]: With dead ends: 60 [2018-12-03 06:00:25,621 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 06:00:25,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=188, Invalid=1294, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 06:00:25,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 06:00:25,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2018-12-03 06:00:25,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 06:00:25,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-12-03 06:00:25,630 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 28 [2018-12-03 06:00:25,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:00:25,630 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-12-03 06:00:25,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 06:00:25,631 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-12-03 06:00:25,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 06:00:25,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:00:25,632 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:00:25,633 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-03 06:00:25,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:00:25,633 INFO L82 PathProgramCache]: Analyzing trace with hash 278503660, now seen corresponding path program 1 times [2018-12-03 06:00:25,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:00:25,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:25,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:00:25,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:25,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:00:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:00:25,841 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-03 06:00:25,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:00:25,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 06:00:25,841 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-12-03 06:00:25,841 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [22], [25], [30], [34], [39], [42], [43], [46], [48], [49], [57], [62], [63], [66], [71], [91], [92], [93], [95] [2018-12-03 06:00:25,842 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 06:00:25,842 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 06:00:25,865 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 06:00:25,865 INFO L272 AbstractInterpreter]: Visited 26 different actions 26 times. Never merged. Never widened. Performed 202 root evaluator evaluations with a maximum evaluation depth of 3. Performed 202 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-12-03 06:00:25,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:00:25,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 06:00:25,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:00:25,866 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4bef79a3-8c12-4514-93f3-a8502bb6d3b3/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 06:00:25,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:00:25,877 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 06:00:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:00:25,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:00:25,894 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-03 06:00:25,895 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-03 06:00:25,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:00:25,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:00:25,902 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-03 06:00:25,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-03 06:00:26,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-12-03 06:00:26,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 23 [2018-12-03 06:00:26,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 06:00:26,130 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-12-03 06:00:26,130 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 06:00:26,141 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 18 treesize of output 16 [2018-12-03 06:00:26,142 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-03 06:00:26,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 06:00:26,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 06:00:26,163 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:45, output treesize:33 [2018-12-03 06:00:26,214 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-03 06:00:26,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:00:26,551 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 15 treesize of output 11 [2018-12-03 06:00:26,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:00:26,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-12-03 06:00:26,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-12-03 06:00:26,588 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 06:00:26,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-12-03 06:00:26,596 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 06:00:26,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-12-03 06:00:26,604 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 06:00:26,607 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:00:26,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:00:26,613 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:69, output treesize:7 [2018-12-03 06:00:26,617 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-03 06:00:26,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 06:00:26,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 32 [2018-12-03 06:00:26,640 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 06:00:26,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 06:00:26,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 06:00:26,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=946, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 06:00:26,641 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 23 states. [2018-12-03 06:00:27,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:00:27,401 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-12-03 06:00:27,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 06:00:27,402 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2018-12-03 06:00:27,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:00:27,403 INFO L225 Difference]: With dead ends: 58 [2018-12-03 06:00:27,403 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 06:00:27,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=260, Invalid=1546, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 06:00:27,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 06:00:27,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-12-03 06:00:27,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 06:00:27,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-12-03 06:00:27,407 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 29 [2018-12-03 06:00:27,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:00:27,407 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-12-03 06:00:27,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 06:00:27,407 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-12-03 06:00:27,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 06:00:27,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:00:27,408 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:00:27,408 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-03 06:00:27,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:00:27,409 INFO L82 PathProgramCache]: Analyzing trace with hash 2124323154, now seen corresponding path program 2 times [2018-12-03 06:00:27,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:00:27,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:27,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:00:27,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:27,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:00:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:00:27,601 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:00:27,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:00:27,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 06:00:27,602 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 06:00:27,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 06:00:27,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:00:27,602 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4bef79a3-8c12-4514-93f3-a8502bb6d3b3/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 06:00:27,607 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 06:00:27,608 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 06:00:27,625 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 06:00:27,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 06:00:27,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:00:27,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 06:00:27,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:00:27,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-03 06:00:27,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-03 06:00:27,659 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 06:00:27,662 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:00:27,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:00:27,667 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-03 06:00:27,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-03 06:00:27,686 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 12 treesize of output 11 [2018-12-03 06:00:27,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:00:27,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:00:27,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:00:27,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-03 06:00:27,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-03 06:00:27,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-03 06:00:27,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:00:27,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:00:27,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 06:00:27,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-12-03 06:00:27,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-12-03 06:00:27,780 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-12-03 06:00:27,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:00:27,790 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 15 treesize of output 12 [2018-12-03 06:00:27,790 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-03 06:00:27,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 06:00:27,798 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-03 06:00:27,798 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2018-12-03 06:00:27,857 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 06:00:27,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:00:28,090 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-03 06:00:28,097 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-03 06:00:28,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:00:28,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:00:28,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:00:28,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:44 [2018-12-03 06:00:28,142 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 06:00:28,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 06:00:28,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 25 [2018-12-03 06:00:28,158 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 06:00:28,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 06:00:28,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 06:00:28,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2018-12-03 06:00:28,159 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 19 states. [2018-12-03 06:00:29,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:00:29,034 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-12-03 06:00:29,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 06:00:29,035 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2018-12-03 06:00:29,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:00:29,035 INFO L225 Difference]: With dead ends: 51 [2018-12-03 06:00:29,035 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 06:00:29,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=216, Invalid=1190, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 06:00:29,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 06:00:29,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-12-03 06:00:29,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 06:00:29,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-12-03 06:00:29,038 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 38 [2018-12-03 06:00:29,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:00:29,038 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-12-03 06:00:29,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 06:00:29,038 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-12-03 06:00:29,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 06:00:29,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:00:29,039 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:00:29,039 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-03 06:00:29,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:00:29,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1429508320, now seen corresponding path program 2 times [2018-12-03 06:00:29,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:00:29,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:29,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 06:00:29,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:00:29,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:00:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:00:29,340 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:00:29,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:00:29,340 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 06:00:29,340 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 06:00:29,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 06:00:29,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:00:29,341 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4bef79a3-8c12-4514-93f3-a8502bb6d3b3/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 06:00:29,346 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 06:00:29,346 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 06:00:29,362 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 06:00:29,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 06:00:29,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:00:29,366 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-03 06:00:29,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-03 06:00:29,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 06:00:29,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 06:00:29,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:00:29,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-03 06:00:29,401 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-03 06:00:29,402 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-03 06:00:29,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:00:29,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:00:29,406 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-03 06:00:29,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-12-03 06:00:29,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-12-03 06:00:29,604 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-03 06:00:29,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:00:29,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 27 [2018-12-03 06:00:29,624 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-03 06:00:29,638 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 20 treesize of output 18 [2018-12-03 06:00:29,638 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-03 06:00:29,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 06:00:29,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 06:00:29,657 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:39 [2018-12-03 06:00:29,740 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 06:00:29,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:00:30,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-12-03 06:00:30,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-12-03 06:00:30,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:00:30,141 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 16 treesize of output 14 [2018-12-03 06:00:30,141 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 06:00:30,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-12-03 06:00:30,150 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 06:00:30,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:00:30,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:00:30,160 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:73, output treesize:43 [2018-12-03 06:00:30,199 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 06:00:30,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 06:00:30,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2018-12-03 06:00:30,213 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 06:00:30,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 06:00:30,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 06:00:30,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1150, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 06:00:30,214 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 25 states. [2018-12-03 06:00:31,070 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2018-12-03 06:00:31,424 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2018-12-03 06:00:32,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:00:32,120 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2018-12-03 06:00:32,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 06:00:32,121 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 39 [2018-12-03 06:00:32,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:00:32,121 INFO L225 Difference]: With dead ends: 49 [2018-12-03 06:00:32,121 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 06:00:32,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=492, Invalid=3048, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 06:00:32,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 06:00:32,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 06:00:32,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 06:00:32,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 06:00:32,123 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-12-03 06:00:32,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:00:32,123 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 06:00:32,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 06:00:32,123 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 06:00:32,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 06:00:32,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 06:00:32 BoogieIcfgContainer [2018-12-03 06:00:32,127 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 06:00:32,127 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 06:00:32,128 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 06:00:32,128 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 06:00:32,128 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:00:21" (3/4) ... [2018-12-03 06:00:32,131 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-03 06:00:32,136 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-03 06:00:32,137 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-03 06:00:32,137 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrncmp [2018-12-03 06:00:32,140 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2018-12-03 06:00:32,141 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-03 06:00:32,141 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-03 06:00:32,167 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4bef79a3-8c12-4514-93f3-a8502bb6d3b3/bin-2019/utaipan/witness.graphml [2018-12-03 06:00:32,167 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 06:00:32,168 INFO L168 Benchmark]: Toolchain (without parser) took 10994.16 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 230.7 MB). Free memory was 948.1 MB in the beginning and 978.3 MB in the end (delta: -30.2 MB). Peak memory consumption was 200.5 MB. Max. memory is 11.5 GB. [2018-12-03 06:00:32,168 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 06:00:32,168 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -144.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-12-03 06:00:32,168 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-03 06:00:32,168 INFO L168 Benchmark]: Boogie Preprocessor took 16.36 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 06:00:32,168 INFO L168 Benchmark]: RCFGBuilder took 209.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-03 06:00:32,169 INFO L168 Benchmark]: TraceAbstraction took 10459.81 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 127.9 MB). Free memory was 1.1 GB in the beginning and 986.2 MB in the end (delta: 78.3 MB). Peak memory consumption was 206.2 MB. Max. memory is 11.5 GB. [2018-12-03 06:00:32,169 INFO L168 Benchmark]: Witness Printer took 39.58 ms. Allocated memory is still 1.3 GB. Free memory was 986.2 MB in the beginning and 978.3 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. [2018-12-03 06:00:32,170 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 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 248.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -144.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.36 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 209.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10459.81 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 127.9 MB). Free memory was 1.1 GB in the beginning and 986.2 MB in the end (delta: 78.3 MB). Peak memory consumption was 206.2 MB. Max. memory is 11.5 GB. * Witness Printer took 39.58 ms. Allocated memory is still 1.3 GB. Free memory was 986.2 MB in the beginning and 978.3 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 53 locations, 15 error locations. SAFE Result, 10.4s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 4.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 566 SDtfs, 872 SDslu, 1993 SDs, 0 SdLazy, 1780 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 492 GetRequests, 251 SyntacticMatches, 10 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1074 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 29 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 508 NumberOfCodeBlocks, 508 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 644 ConstructedInterpolants, 134 QuantifiedInterpolants, 282583 SizeOfPredicates, 88 NumberOfNonLiveVariables, 775 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 26 InterpolantComputations, 13 PerfectInterpolantSequences, 38/137 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...