./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-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_b6f73e0e-47fa-460b-ac5c-3a84c39204a5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b6f73e0e-47fa-460b-ac5c-3a84c39204a5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b6f73e0e-47fa-460b-ac5c-3a84c39204a5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b6f73e0e-47fa-460b-ac5c-3a84c39204a5/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b6f73e0e-47fa-460b-ac5c-3a84c39204a5/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b6f73e0e-47fa-460b-ac5c-3a84c39204a5/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 bae2699bcd2830a9f6fd8179c1786410249a39fb ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 11:58:29,627 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 11:58:29,627 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 11:58:29,633 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 11:58:29,634 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 11:58:29,634 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 11:58:29,635 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 11:58:29,636 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 11:58:29,636 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 11:58:29,637 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 11:58:29,637 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 11:58:29,637 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 11:58:29,638 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 11:58:29,638 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 11:58:29,639 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 11:58:29,639 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 11:58:29,640 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 11:58:29,640 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 11:58:29,641 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 11:58:29,642 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 11:58:29,643 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 11:58:29,643 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 11:58:29,644 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 11:58:29,644 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 11:58:29,644 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 11:58:29,645 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 11:58:29,645 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 11:58:29,646 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 11:58:29,646 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 11:58:29,647 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 11:58:29,647 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 11:58:29,647 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 11:58:29,647 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 11:58:29,647 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 11:58:29,648 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 11:58:29,648 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 11:58:29,648 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b6f73e0e-47fa-460b-ac5c-3a84c39204a5/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-02 11:58:29,655 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 11:58:29,656 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 11:58:29,656 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 11:58:29,656 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 11:58:29,656 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 11:58:29,656 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 11:58:29,657 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 11:58:29,657 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 11:58:29,657 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 11:58:29,657 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 11:58:29,657 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 11:58:29,657 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 11:58:29,657 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 11:58:29,658 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 11:58:29,658 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 11:58:29,658 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 11:58:29,658 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 11:58:29,658 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 11:58:29,658 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 11:58:29,658 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 11:58:29,659 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 11:58:29,659 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 11:58:29,659 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 11:58:29,659 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 11:58:29,659 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 11:58:29,659 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 11:58:29,659 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 11:58:29,659 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 11:58:29,660 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 11:58:29,660 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 11:58:29,660 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 11:58:29,660 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 11:58:29,660 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 11:58:29,660 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 11:58:29,660 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 11:58:29,660 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 11:58:29,660 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_b6f73e0e-47fa-460b-ac5c-3a84c39204a5/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 -> bae2699bcd2830a9f6fd8179c1786410249a39fb [2018-12-02 11:58:29,679 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 11:58:29,688 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 11:58:29,691 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 11:58:29,692 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 11:58:29,692 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 11:58:29,693 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b6f73e0e-47fa-460b-ac5c-3a84c39204a5/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-12-02 11:58:29,733 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b6f73e0e-47fa-460b-ac5c-3a84c39204a5/bin-2019/utaipan/data/8b435c577/5a9fe912e59244b898f64cce9689025d/FLAG204f36ef1 [2018-12-02 11:58:30,141 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 11:58:30,142 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b6f73e0e-47fa-460b-ac5c-3a84c39204a5/sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-12-02 11:58:30,148 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b6f73e0e-47fa-460b-ac5c-3a84c39204a5/bin-2019/utaipan/data/8b435c577/5a9fe912e59244b898f64cce9689025d/FLAG204f36ef1 [2018-12-02 11:58:30,159 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b6f73e0e-47fa-460b-ac5c-3a84c39204a5/bin-2019/utaipan/data/8b435c577/5a9fe912e59244b898f64cce9689025d [2018-12-02 11:58:30,161 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 11:58:30,162 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 11:58:30,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 11:58:30,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 11:58:30,164 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 11:58:30,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:58:30" (1/1) ... [2018-12-02 11:58:30,167 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cffd3ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:58:30, skipping insertion in model container [2018-12-02 11:58:30,167 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:58:30" (1/1) ... [2018-12-02 11:58:30,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 11:58:30,199 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 11:58:30,362 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 11:58:30,405 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 11:58:30,429 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 11:58:30,460 INFO L195 MainTranslator]: Completed translation [2018-12-02 11:58:30,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:58:30 WrapperNode [2018-12-02 11:58:30,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 11:58:30,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 11:58:30,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 11:58:30,461 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 11:58:30,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:58:30" (1/1) ... [2018-12-02 11:58:30,474 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:58:30" (1/1) ... [2018-12-02 11:58:30,478 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 11:58:30,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 11:58:30,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 11:58:30,479 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 11:58:30,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:58:30" (1/1) ... [2018-12-02 11:58:30,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:58:30" (1/1) ... [2018-12-02 11:58:30,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:58:30" (1/1) ... [2018-12-02 11:58:30,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:58:30" (1/1) ... [2018-12-02 11:58:30,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:58:30" (1/1) ... [2018-12-02 11:58:30,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:58:30" (1/1) ... [2018-12-02 11:58:30,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:58:30" (1/1) ... [2018-12-02 11:58:30,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 11:58:30,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 11:58:30,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 11:58:30,495 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 11:58:30,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:58:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6f73e0e-47fa-460b-ac5c-3a84c39204a5/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-02 11:58:30,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 11:58:30,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 11:58:30,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 11:58:30,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 11:58:30,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 11:58:30,526 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 11:58:30,526 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 11:58:30,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 11:58:30,527 INFO L130 BoogieDeclarations]: Found specification of procedure cstrspn [2018-12-02 11:58:30,527 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrspn [2018-12-02 11:58:30,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 11:58:30,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 11:58:30,693 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 11:58:30,694 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 11:58:30,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:58:30 BoogieIcfgContainer [2018-12-02 11:58:30,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 11:58:30,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 11:58:30,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 11:58:30,697 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 11:58:30,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:58:30" (1/3) ... [2018-12-02 11:58:30,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e97e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:58:30, skipping insertion in model container [2018-12-02 11:58:30,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:58:30" (2/3) ... [2018-12-02 11:58:30,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e97e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:58:30, skipping insertion in model container [2018-12-02 11:58:30,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:58:30" (3/3) ... [2018-12-02 11:58:30,699 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-12-02 11:58:30,707 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 11:58:30,713 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-12-02 11:58:30,725 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-12-02 11:58:30,740 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 11:58:30,740 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 11:58:30,740 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 11:58:30,740 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 11:58:30,741 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 11:58:30,741 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 11:58:30,741 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 11:58:30,741 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 11:58:30,749 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-12-02 11:58:30,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 11:58:30,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:58:30,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:58:30,757 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-12-02 11:58:30,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:58:30,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1122979506, now seen corresponding path program 1 times [2018-12-02 11:58:30,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:58:30,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:58:30,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:58:30,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:58:30,796 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:58:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:58:30,878 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-02 11:58:30,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:58:30,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 11:58:30,879 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:58:30,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 11:58:30,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 11:58:30,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 11:58:30,891 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2018-12-02 11:58:30,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:58:30,927 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-12-02 11:58:30,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 11:58:30,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 11:58:30,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:58:30,933 INFO L225 Difference]: With dead ends: 37 [2018-12-02 11:58:30,933 INFO L226 Difference]: Without dead ends: 34 [2018-12-02 11:58:30,934 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-02 11:58:30,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-02 11:58:30,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-02 11:58:30,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-02 11:58:30,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-12-02 11:58:30,954 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 10 [2018-12-02 11:58:30,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:58:30,955 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-12-02 11:58:30,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 11:58:30,955 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-12-02 11:58:30,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 11:58:30,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:58:30,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:58:30,956 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-12-02 11:58:30,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:58:30,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1122979507, now seen corresponding path program 1 times [2018-12-02 11:58:30,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:58:30,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:58:30,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:58:30,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:58:30,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:58:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:58:30,988 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-02 11:58:30,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:58:30,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 11:58:30,988 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:58:30,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 11:58:30,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 11:58:30,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 11:58:30,990 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 4 states. [2018-12-02 11:58:31,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:58:31,006 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-12-02 11:58:31,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 11:58:31,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-02 11:58:31,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:58:31,007 INFO L225 Difference]: With dead ends: 33 [2018-12-02 11:58:31,007 INFO L226 Difference]: Without dead ends: 33 [2018-12-02 11:58:31,008 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-02 11:58:31,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-02 11:58:31,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-02 11:58:31,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 11:58:31,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-12-02 11:58:31,010 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 10 [2018-12-02 11:58:31,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:58:31,010 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-12-02 11:58:31,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 11:58:31,011 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-12-02 11:58:31,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 11:58:31,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:58:31,011 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:58:31,011 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-12-02 11:58:31,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:58:31,011 INFO L82 PathProgramCache]: Analyzing trace with hash 452626310, now seen corresponding path program 1 times [2018-12-02 11:58:31,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:58:31,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:58:31,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:58:31,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:58:31,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:58:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:58:31,035 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-02 11:58:31,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:58:31,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 11:58:31,036 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:58:31,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 11:58:31,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 11:58:31,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 11:58:31,037 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 3 states. [2018-12-02 11:58:31,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:58:31,052 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-12-02 11:58:31,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 11:58:31,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-02 11:58:31,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:58:31,053 INFO L225 Difference]: With dead ends: 32 [2018-12-02 11:58:31,053 INFO L226 Difference]: Without dead ends: 32 [2018-12-02 11:58:31,053 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-02 11:58:31,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-02 11:58:31,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-02 11:58:31,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-02 11:58:31,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-12-02 11:58:31,055 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 11 [2018-12-02 11:58:31,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:58:31,055 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-12-02 11:58:31,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 11:58:31,056 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-12-02 11:58:31,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 11:58:31,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:58:31,056 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:58:31,056 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-12-02 11:58:31,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:58:31,057 INFO L82 PathProgramCache]: Analyzing trace with hash 452626311, now seen corresponding path program 1 times [2018-12-02 11:58:31,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:58:31,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:58:31,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:58:31,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:58:31,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:58:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:58:31,083 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-02 11:58:31,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:58:31,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 11:58:31,083 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:58:31,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 11:58:31,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 11:58:31,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 11:58:31,084 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 4 states. [2018-12-02 11:58:31,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:58:31,094 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-12-02 11:58:31,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 11:58:31,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-02 11:58:31,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:58:31,095 INFO L225 Difference]: With dead ends: 31 [2018-12-02 11:58:31,095 INFO L226 Difference]: Without dead ends: 31 [2018-12-02 11:58:31,095 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-02 11:58:31,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-02 11:58:31,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-02 11:58:31,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-02 11:58:31,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-12-02 11:58:31,097 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2018-12-02 11:58:31,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:58:31,097 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-12-02 11:58:31,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 11:58:31,098 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-12-02 11:58:31,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 11:58:31,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:58:31,098 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:58:31,098 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-12-02 11:58:31,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:58:31,099 INFO L82 PathProgramCache]: Analyzing trace with hash -2083601020, now seen corresponding path program 1 times [2018-12-02 11:58:31,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:58:31,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:58:31,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:58:31,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:58:31,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:58:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:58:31,134 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-02 11:58:31,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:58:31,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 11:58:31,134 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:58:31,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 11:58:31,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 11:58:31,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 11:58:31,135 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 6 states. [2018-12-02 11:58:31,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:58:31,184 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-12-02 11:58:31,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 11:58:31,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-02 11:58:31,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:58:31,185 INFO L225 Difference]: With dead ends: 30 [2018-12-02 11:58:31,185 INFO L226 Difference]: Without dead ends: 30 [2018-12-02 11:58:31,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 11:58:31,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-02 11:58:31,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-02 11:58:31,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-02 11:58:31,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-12-02 11:58:31,188 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 15 [2018-12-02 11:58:31,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:58:31,189 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-12-02 11:58:31,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 11:58:31,189 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-12-02 11:58:31,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 11:58:31,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:58:31,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:58:31,190 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-12-02 11:58:31,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:58:31,190 INFO L82 PathProgramCache]: Analyzing trace with hash -2083601019, now seen corresponding path program 1 times [2018-12-02 11:58:31,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:58:31,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:58:31,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:58:31,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:58:31,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:58:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:58:31,272 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-02 11:58:31,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:58:31,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 11:58:31,273 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:58:31,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 11:58:31,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 11:58:31,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 11:58:31,273 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 8 states. [2018-12-02 11:58:31,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:58:31,321 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-12-02 11:58:31,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 11:58:31,322 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-02 11:58:31,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:58:31,322 INFO L225 Difference]: With dead ends: 33 [2018-12-02 11:58:31,322 INFO L226 Difference]: Without dead ends: 33 [2018-12-02 11:58:31,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-02 11:58:31,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-02 11:58:31,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-12-02 11:58:31,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-02 11:58:31,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-12-02 11:58:31,325 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 15 [2018-12-02 11:58:31,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:58:31,325 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-12-02 11:58:31,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 11:58:31,325 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-12-02 11:58:31,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 11:58:31,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:58:31,325 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-02 11:58:31,326 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-12-02 11:58:31,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:58:31,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1690619934, now seen corresponding path program 1 times [2018-12-02 11:58:31,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:58:31,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:58:31,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:58:31,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:58:31,327 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:58:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:58:31,369 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-02 11:58:31,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:58:31,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 11:58:31,369 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:58:31,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 11:58:31,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 11:58:31,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 11:58:31,370 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 7 states. [2018-12-02 11:58:31,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:58:31,433 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-12-02 11:58:31,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 11:58:31,433 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-12-02 11:58:31,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:58:31,433 INFO L225 Difference]: With dead ends: 32 [2018-12-02 11:58:31,433 INFO L226 Difference]: Without dead ends: 32 [2018-12-02 11:58:31,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-02 11:58:31,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-02 11:58:31,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-12-02 11:58:31,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-02 11:58:31,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-12-02 11:58:31,435 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 18 [2018-12-02 11:58:31,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:58:31,436 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-12-02 11:58:31,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 11:58:31,436 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-12-02 11:58:31,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 11:58:31,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:58:31,436 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-02 11:58:31,436 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-12-02 11:58:31,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:58:31,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1690619933, now seen corresponding path program 1 times [2018-12-02 11:58:31,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:58:31,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:58:31,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:58:31,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:58:31,437 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:58:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:58:31,515 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-02 11:58:31,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:58:31,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 11:58:31,516 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:58:31,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 11:58:31,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 11:58:31,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-02 11:58:31,517 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 9 states. [2018-12-02 11:58:31,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:58:31,586 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-12-02 11:58:31,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 11:58:31,586 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-12-02 11:58:31,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:58:31,587 INFO L225 Difference]: With dead ends: 35 [2018-12-02 11:58:31,587 INFO L226 Difference]: Without dead ends: 35 [2018-12-02 11:58:31,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-12-02 11:58:31,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-02 11:58:31,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-12-02 11:58:31,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 11:58:31,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-12-02 11:58:31,589 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 18 [2018-12-02 11:58:31,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:58:31,589 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-12-02 11:58:31,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 11:58:31,589 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-12-02 11:58:31,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 11:58:31,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:58:31,590 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-02 11:58:31,590 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-12-02 11:58:31,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:58:31,590 INFO L82 PathProgramCache]: Analyzing trace with hash -405726064, now seen corresponding path program 1 times [2018-12-02 11:58:31,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:58:31,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:58:31,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:58:31,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:58:31,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:58:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:58:31,690 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-02 11:58:31,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:58:31,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 11:58:31,690 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:58:31,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 11:58:31,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 11:58:31,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-02 11:58:31,691 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 11 states. [2018-12-02 11:58:31,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:58:31,787 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-12-02 11:58:31,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 11:58:31,788 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-12-02 11:58:31,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:58:31,788 INFO L225 Difference]: With dead ends: 58 [2018-12-02 11:58:31,788 INFO L226 Difference]: Without dead ends: 58 [2018-12-02 11:58:31,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-12-02 11:58:31,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-02 11:58:31,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2018-12-02 11:58:31,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-02 11:58:31,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-12-02 11:58:31,792 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 23 [2018-12-02 11:58:31,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:58:31,792 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-12-02 11:58:31,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 11:58:31,793 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-12-02 11:58:31,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 11:58:31,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:58:31,793 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-02 11:58:31,793 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-12-02 11:58:31,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:58:31,793 INFO L82 PathProgramCache]: Analyzing trace with hash -405723886, now seen corresponding path program 1 times [2018-12-02 11:58:31,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:58:31,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:58:31,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:58:31,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:58:31,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:58:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:58:31,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:58:31,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 11:58:31,977 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 11:58:31,978 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-12-02 11:58:31,979 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [8], [16], [18], [19], [22], [29], [31], [32], [35], [39], [40], [42], [43], [48], [53], [60], [61], [62], [64] [2018-12-02 11:58:31,998 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 11:58:31,998 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 11:58:32,104 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 11:58:32,105 INFO L272 AbstractInterpreter]: Visited 22 different actions 27 times. Merged at 5 different actions 5 times. Never widened. Performed 210 root evaluator evaluations with a maximum evaluation depth of 3. Performed 210 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-12-02 11:58:32,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:58:32,111 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 11:58:32,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 11:58:32,111 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6f73e0e-47fa-460b-ac5c-3a84c39204a5/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-02 11:58:32,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:58:32,118 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 11:58:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:58:32,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 11:58:32,170 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-02 11:58:32,172 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-02 11:58:32,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:32,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 11:58:32,180 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-02 11:58:32,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-02 11:58:32,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 11:58:32,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 11:58:32,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 11:58:32,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 11:58:32,348 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-02 11:58:32,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-12-02 11:58:32,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:58:32,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 11:58:32,632 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-02 11:58:32,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:32,639 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 15 treesize of output 13 [2018-12-02 11:58:32,646 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 7 treesize of output 3 [2018-12-02 11:58:32,647 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:32,647 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 11:58:32,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 11:58:32,652 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:39, output treesize:7 [2018-12-02 11:58:32,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:58:32,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 11:58:32,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2018-12-02 11:58:32,676 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 11:58:32,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 11:58:32,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 11:58:32,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2018-12-02 11:58:32,677 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 20 states. [2018-12-02 11:58:34,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:58:34,374 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-12-02 11:58:34,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 11:58:34,375 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2018-12-02 11:58:34,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:58:34,377 INFO L225 Difference]: With dead ends: 76 [2018-12-02 11:58:34,377 INFO L226 Difference]: Without dead ends: 76 [2018-12-02 11:58:34,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=237, Invalid=1323, Unknown=0, NotChecked=0, Total=1560 [2018-12-02 11:58:34,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-02 11:58:34,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2018-12-02 11:58:34,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-02 11:58:34,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2018-12-02 11:58:34,380 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 23 [2018-12-02 11:58:34,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:58:34,380 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2018-12-02 11:58:34,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 11:58:34,380 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2018-12-02 11:58:34,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 11:58:34,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:58:34,381 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-02 11:58:34,381 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-12-02 11:58:34,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:58:34,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1994073966, now seen corresponding path program 1 times [2018-12-02 11:58:34,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:58:34,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:58:34,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:58:34,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:58:34,383 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:58:34,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:58:34,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:58:34,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 11:58:34,547 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 11:58:34,547 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-12-02 11:58:34,547 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [22], [29], [31], [32], [34], [35], [39], [40], [43], [48], [51], [60], [61], [62], [64] [2018-12-02 11:58:34,548 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 11:58:34,548 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 11:58:34,572 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 11:58:34,572 INFO L272 AbstractInterpreter]: Visited 22 different actions 22 times. Never merged. Never widened. Performed 160 root evaluator evaluations with a maximum evaluation depth of 3. Performed 160 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-12-02 11:58:34,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:58:34,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 11:58:34,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 11:58:34,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6f73e0e-47fa-460b-ac5c-3a84c39204a5/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-02 11:58:34,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:58:34,580 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 11:58:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:58:34,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 11:58:34,605 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-02 11:58:34,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:34,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 11:58:34,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-02 11:58:34,625 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-02 11:58:34,626 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-02 11:58:34,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:34,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 11:58:34,632 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-02 11:58:34,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-12-02 11:58:34,654 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-02 11:58:34,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, 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-02 11:58:34,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:34,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 11:58:34,670 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-02 11:58:34,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-12-02 11:58:34,794 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 30 treesize of output 28 [2018-12-02 11:58:34,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 11:58:34,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 11:58:34,808 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-02 11:58:34,809 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:34,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 11:58:34,822 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-02 11:58:34,822 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-12-02 11:58:34,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:58:34,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 11:58:35,219 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-02 11:58:35,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:35,228 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 15 treesize of output 13 [2018-12-02 11:58:35,236 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 7 treesize of output 3 [2018-12-02 11:58:35,236 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:35,237 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 11:58:35,242 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-02 11:58:35,242 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:39, output treesize:7 [2018-12-02 11:58:35,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:58:35,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 11:58:35,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 30 [2018-12-02 11:58:35,263 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 11:58:35,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-02 11:58:35,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-02 11:58:35,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=832, Unknown=0, NotChecked=0, Total=930 [2018-12-02 11:58:35,263 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand 22 states. [2018-12-02 11:58:36,024 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2018-12-02 11:58:36,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:58:36,365 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2018-12-02 11:58:36,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 11:58:36,366 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2018-12-02 11:58:36,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:58:36,367 INFO L225 Difference]: With dead ends: 82 [2018-12-02 11:58:36,367 INFO L226 Difference]: Without dead ends: 82 [2018-12-02 11:58:36,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=219, Invalid=1503, Unknown=0, NotChecked=0, Total=1722 [2018-12-02 11:58:36,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-02 11:58:36,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2018-12-02 11:58:36,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-02 11:58:36,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 91 transitions. [2018-12-02 11:58:36,379 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 91 transitions. Word has length 23 [2018-12-02 11:58:36,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:58:36,380 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 91 transitions. [2018-12-02 11:58:36,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-02 11:58:36,380 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 91 transitions. [2018-12-02 11:58:36,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 11:58:36,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:58:36,381 INFO L402 BasicCegarLoop]: trace histogram [1, 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-02 11:58:36,381 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-12-02 11:58:36,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:58:36,382 INFO L82 PathProgramCache]: Analyzing trace with hash 889347550, now seen corresponding path program 1 times [2018-12-02 11:58:36,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:58:36,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:58:36,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:58:36,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:58:36,383 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:58:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:58:36,425 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-02 11:58:36,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:58:36,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 11:58:36,425 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:58:36,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 11:58:36,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 11:58:36,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 11:58:36,426 INFO L87 Difference]: Start difference. First operand 77 states and 91 transitions. Second operand 4 states. [2018-12-02 11:58:36,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:58:36,451 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2018-12-02 11:58:36,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 11:58:36,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-12-02 11:58:36,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:58:36,452 INFO L225 Difference]: With dead ends: 76 [2018-12-02 11:58:36,452 INFO L226 Difference]: Without dead ends: 68 [2018-12-02 11:58:36,452 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-02 11:58:36,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-02 11:58:36,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-02 11:58:36,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-02 11:58:36,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2018-12-02 11:58:36,456 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 25 [2018-12-02 11:58:36,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:58:36,456 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2018-12-02 11:58:36,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 11:58:36,456 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2018-12-02 11:58:36,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 11:58:36,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:58:36,456 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:58:36,456 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-12-02 11:58:36,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:58:36,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1814031037, now seen corresponding path program 2 times [2018-12-02 11:58:36,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:58:36,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:58:36,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:58:36,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:58:36,457 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:58:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:58:36,682 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:58:36,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 11:58:36,682 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 11:58:36,682 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 11:58:36,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 11:58:36,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 11:58:36,683 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6f73e0e-47fa-460b-ac5c-3a84c39204a5/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-02 11:58:36,689 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 11:58:36,690 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 11:58:36,705 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 11:58:36,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 11:58:36,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 11:58:36,720 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-02 11:58:36,722 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-02 11:58:36,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:36,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 11:58:36,732 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-02 11:58:36,732 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:36,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 11:58:36,741 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:30, output treesize:27 [2018-12-02 11:58:36,764 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 16 treesize of output 13 [2018-12-02 11:58:36,765 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-02 11:58:36,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:36,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 11:58:36,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 11:58:36,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-12-02 11:58:36,798 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 29 treesize of output 30 [2018-12-02 11:58:36,800 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-02 11:58:36,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:36,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 11:58:36,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 11:58:36,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:48 [2018-12-02 11:58:37,275 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 40 treesize of output 36 [2018-12-02 11:58:37,279 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 11:58:37,280 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 15 treesize of output 15 [2018-12-02 11:58:37,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:37,294 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 15 [2018-12-02 11:58:37,294 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 11:58:37,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 11:58:37,324 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 2 xjuncts. [2018-12-02 11:58:37,324 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:70, output treesize:81 [2018-12-02 11:58:37,511 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:58:37,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 11:58:38,261 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 65 [2018-12-02 11:58:38,280 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-02 11:58:38,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:38,297 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 32 treesize of output 26 [2018-12-02 11:58:38,306 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 7 treesize of output 5 [2018-12-02 11:58:38,307 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:38,313 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-12-02 11:58:38,313 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:38,315 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 17 treesize of output 7 [2018-12-02 11:58:38,315 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:38,319 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 11:58:38,320 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-12-02 11:58:38,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-12-02 11:58:38,334 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:38,338 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 11:58:38,343 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 42 treesize of output 42 [2018-12-02 11:58:38,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-12-02 11:58:38,370 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:38,380 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 20 treesize of output 11 [2018-12-02 11:58:38,380 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:38,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 34 [2018-12-02 11:58:38,394 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-12-02 11:58:38,402 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 11:58:38,408 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 36 treesize of output 38 [2018-12-02 11:58:38,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 43 [2018-12-02 11:58:38,436 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2018-12-02 11:58:38,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-12-02 11:58:38,438 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:38,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 34 [2018-12-02 11:58:38,453 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-12-02 11:58:38,501 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2018-12-02 11:58:38,502 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-12-02 11:58:38,521 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 23 treesize of output 21 [2018-12-02 11:58:38,521 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:38,535 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 11:58:38,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-02 11:58:38,610 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 67 [2018-12-02 11:58:38,629 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-02 11:58:38,630 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:38,647 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 32 treesize of output 26 [2018-12-02 11:58:38,656 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 7 treesize of output 5 [2018-12-02 11:58:38,657 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:38,663 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 17 treesize of output 7 [2018-12-02 11:58:38,663 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:38,664 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-12-02 11:58:38,664 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:38,669 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 11:58:38,670 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-12-02 11:58:38,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-12-02 11:58:38,683 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:38,690 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 11:58:38,695 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 42 treesize of output 42 [2018-12-02 11:58:38,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 34 [2018-12-02 11:58:38,731 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-12-02 11:58:38,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-12-02 11:58:38,745 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:38,754 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 20 treesize of output 11 [2018-12-02 11:58:38,754 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:38,761 INFO L267 ElimStorePlain]: Start of recursive call 28: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 11:58:38,766 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 36 treesize of output 38 [2018-12-02 11:58:38,787 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 34 treesize of output 32 [2018-12-02 11:58:38,787 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:38,789 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 32 treesize of output 30 [2018-12-02 11:58:38,789 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:38,816 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 18 [2018-12-02 11:58:38,816 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:38,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-12-02 11:58:38,818 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:38,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-12-02 11:58:38,838 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:38,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 43 [2018-12-02 11:58:38,848 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 3 xjuncts. [2018-12-02 11:58:38,865 INFO L267 ElimStorePlain]: Start of recursive call 32: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 11:58:38,893 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-02 11:58:38,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 9 xjuncts. [2018-12-02 11:58:38,980 INFO L202 ElimStorePlain]: Needed 38 recursive calls to eliminate 4 variables, input treesize:175, output treesize:1187 [2018-12-02 11:58:39,432 WARN L180 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 69 [2018-12-02 11:58:39,443 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:58:39,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 11:58:39,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 43 [2018-12-02 11:58:39,458 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 11:58:39,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-02 11:58:39,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-02 11:58:39,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1756, Unknown=0, NotChecked=0, Total=1892 [2018-12-02 11:58:39,459 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 30 states. [2018-12-02 11:58:41,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:58:41,815 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2018-12-02 11:58:41,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-02 11:58:41,815 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 28 [2018-12-02 11:58:41,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:58:41,815 INFO L225 Difference]: With dead ends: 96 [2018-12-02 11:58:41,815 INFO L226 Difference]: Without dead ends: 73 [2018-12-02 11:58:41,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=519, Invalid=4451, Unknown=0, NotChecked=0, Total=4970 [2018-12-02 11:58:41,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-02 11:58:41,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2018-12-02 11:58:41,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-02 11:58:41,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2018-12-02 11:58:41,818 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 28 [2018-12-02 11:58:41,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:58:41,818 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-12-02 11:58:41,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-02 11:58:41,819 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2018-12-02 11:58:41,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 11:58:41,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:58:41,819 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:58:41,819 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-12-02 11:58:41,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:58:41,819 INFO L82 PathProgramCache]: Analyzing trace with hash -757214563, now seen corresponding path program 2 times [2018-12-02 11:58:41,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:58:41,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:58:41,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 11:58:41,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:58:41,820 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:58:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:58:42,006 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:58:42,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 11:58:42,006 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 11:58:42,006 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 11:58:42,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 11:58:42,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 11:58:42,006 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6f73e0e-47fa-460b-ac5c-3a84c39204a5/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-02 11:58:42,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 11:58:42,014 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 11:58:42,030 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 11:58:42,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 11:58:42,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 11:58:42,041 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-02 11:58:42,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:42,046 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-02 11:58:42,048 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-02 11:58:42,048 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:42,052 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 11:58:42,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 11:58:42,056 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-02 11:58:42,074 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 16 treesize of output 13 [2018-12-02 11:58:42,076 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-02 11:58:42,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:42,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 11:58:42,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 11:58:42,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-12-02 11:58:42,106 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 29 treesize of output 30 [2018-12-02 11:58:42,108 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-02 11:58:42,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:42,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 11:58:42,117 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-02 11:58:42,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-12-02 11:58:42,284 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 34 treesize of output 32 [2018-12-02 11:58:42,290 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 15 [2018-12-02 11:58:42,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 11:58:42,296 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-02 11:58:42,296 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:42,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 11:58:42,306 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-02 11:58:42,307 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:47 [2018-12-02 11:58:42,388 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:58:42,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 11:58:42,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2018-12-02 11:58:42,794 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 7 treesize of output 3 [2018-12-02 11:58:42,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:42,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 11:58:42,816 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 37 treesize of output 35 [2018-12-02 11:58:42,830 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 7 treesize of output 3 [2018-12-02 11:58:42,830 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:42,835 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 11:58:42,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 11:58:42,846 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:79, output treesize:98 [2018-12-02 11:58:42,909 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:58:42,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 11:58:42,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 34 [2018-12-02 11:58:42,923 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 11:58:42,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-02 11:58:42,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-02 11:58:42,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1077, Unknown=0, NotChecked=0, Total=1190 [2018-12-02 11:58:42,924 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand 24 states. [2018-12-02 11:58:44,022 WARN L180 SmtUtils]: Spent 763.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2018-12-02 11:58:44,858 WARN L180 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2018-12-02 11:58:44,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:58:44,898 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-12-02 11:58:44,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 11:58:44,898 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2018-12-02 11:58:44,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:58:44,898 INFO L225 Difference]: With dead ends: 58 [2018-12-02 11:58:44,898 INFO L226 Difference]: Without dead ends: 58 [2018-12-02 11:58:44,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=295, Invalid=2057, Unknown=0, NotChecked=0, Total=2352 [2018-12-02 11:58:44,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-02 11:58:44,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 34. [2018-12-02 11:58:44,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-02 11:58:44,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-12-02 11:58:44,901 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 31 [2018-12-02 11:58:44,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:58:44,901 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-12-02 11:58:44,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-02 11:58:44,901 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-12-02 11:58:44,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 11:58:44,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:58:44,901 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:58:44,901 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-12-02 11:58:44,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:58:44,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1847149260, now seen corresponding path program 1 times [2018-12-02 11:58:44,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:58:44,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:58:44,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 11:58:44,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:58:44,902 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:58:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:58:44,992 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 11:58:44,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 11:58:44,992 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 11:58:44,992 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-12-02 11:58:44,992 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [22], [29], [31], [32], [35], [39], [40], [42], [43], [48], [53], [60], [61], [62], [64] [2018-12-02 11:58:44,993 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 11:58:44,993 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 11:58:45,018 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 11:58:45,018 INFO L272 AbstractInterpreter]: Visited 22 different actions 27 times. Merged at 5 different actions 5 times. Never widened. Performed 208 root evaluator evaluations with a maximum evaluation depth of 3. Performed 208 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-12-02 11:58:45,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:58:45,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 11:58:45,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 11:58:45,020 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6f73e0e-47fa-460b-ac5c-3a84c39204a5/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-02 11:58:45,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:58:45,027 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 11:58:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:58:45,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 11:58:45,043 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-02 11:58:45,048 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-02 11:58:45,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 11:58:45,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 11:58:45,075 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-02 11:58:45,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-02 11:58:45,079 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 15 treesize of output 12 [2018-12-02 11:58:45,080 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-02 11:58:45,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:45,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 11:58:45,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 11:58:45,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-02 11:58:45,145 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 21 treesize of output 17 [2018-12-02 11:58:45,149 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 17 treesize of output 14 [2018-12-02 11:58:45,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 11:58:45,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 11:58:45,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 11:58:45,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-12-02 11:58:45,219 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:58:45,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 11:58:45,514 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 15 treesize of output 13 [2018-12-02 11:58:45,521 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 7 treesize of output 3 [2018-12-02 11:58:45,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 11:58:45,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 11:58:45,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 11:58:45,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-12-02 11:58:45,564 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:58:45,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 11:58:45,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 33 [2018-12-02 11:58:45,580 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 11:58:45,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 11:58:45,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 11:58:45,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=996, Unknown=0, NotChecked=0, Total=1122 [2018-12-02 11:58:45,581 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 21 states. [2018-12-02 11:58:46,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:58:46,224 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-12-02 11:58:46,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 11:58:46,224 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2018-12-02 11:58:46,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:58:46,224 INFO L225 Difference]: With dead ends: 44 [2018-12-02 11:58:46,224 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 11:58:46,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=533, Invalid=2119, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 11:58:46,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 11:58:46,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 11:58:46,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 11:58:46,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 11:58:46,225 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-12-02 11:58:46,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:58:46,225 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 11:58:46,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 11:58:46,225 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 11:58:46,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 11:58:46,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:58:46 BoogieIcfgContainer [2018-12-02 11:58:46,229 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 11:58:46,229 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 11:58:46,229 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 11:58:46,229 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 11:58:46,229 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:58:30" (3/4) ... [2018-12-02 11:58:46,231 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 11:58:46,235 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 11:58:46,235 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 11:58:46,235 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrspn [2018-12-02 11:58:46,237 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-12-02 11:58:46,237 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-02 11:58:46,238 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 11:58:46,260 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b6f73e0e-47fa-460b-ac5c-3a84c39204a5/bin-2019/utaipan/witness.graphml [2018-12-02 11:58:46,260 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 11:58:46,261 INFO L168 Benchmark]: Toolchain (without parser) took 16099.49 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 394.8 MB). Free memory was 948.1 MB in the beginning and 1.2 GB in the end (delta: -233.7 MB). Peak memory consumption was 161.1 MB. Max. memory is 11.5 GB. [2018-12-02 11:58:46,261 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 11:58:46,261 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -193.1 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2018-12-02 11:58:46,261 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 11:58:46,261 INFO L168 Benchmark]: Boogie Preprocessor took 16.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 11:58:46,261 INFO L168 Benchmark]: RCFGBuilder took 199.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2018-12-02 11:58:46,262 INFO L168 Benchmark]: TraceAbstraction took 15534.24 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 238.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -75.6 MB). Peak memory consumption was 163.0 MB. Max. memory is 11.5 GB. [2018-12-02 11:58:46,262 INFO L168 Benchmark]: Witness Printer took 31.25 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. [2018-12-02 11:58:46,263 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 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 298.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -193.1 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 199.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15534.24 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 238.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -75.6 MB). Peak memory consumption was 163.0 MB. Max. memory is 11.5 GB. * Witness Printer took 31.25 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 563]: 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: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 38 locations, 9 error locations. SAFE Result, 15.4s OverallTime, 15 OverallIterations, 4 TraceHistogramMax, 8.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 370 SDtfs, 722 SDslu, 1893 SDs, 0 SdLazy, 2086 SolverSat, 156 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 488 GetRequests, 177 SyntacticMatches, 11 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2102 ImplicationChecksByTransitivity, 10.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=11, 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, 15 MinimizatonAttempts, 69 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 432 NumberOfCodeBlocks, 432 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 545 ConstructedInterpolants, 90 QuantifiedInterpolants, 230632 SizeOfPredicates, 112 NumberOfNonLiveVariables, 779 ConjunctsInSsa, 231 ConjunctsInUnsatCore, 25 InterpolantComputations, 10 PerfectInterpolantSequences, 28/140 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...