./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-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_ec6af3e5-5c2a-4ade-81b7-f9f6e64d70ec/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ec6af3e5-5c2a-4ade-81b7-f9f6e64d70ec/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ec6af3e5-5c2a-4ade-81b7-f9f6e64d70ec/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ec6af3e5-5c2a-4ade-81b7-f9f6e64d70ec/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ec6af3e5-5c2a-4ade-81b7-f9f6e64d70ec/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ec6af3e5-5c2a-4ade-81b7-f9f6e64d70ec/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 37ce12f320cb92b62d01decbfb4f63ee1143a42a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 21:41:51,124 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 21:41:51,126 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 21:41:51,133 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 21:41:51,133 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 21:41:51,133 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 21:41:51,134 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 21:41:51,135 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 21:41:51,136 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 21:41:51,137 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 21:41:51,137 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 21:41:51,137 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 21:41:51,138 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 21:41:51,138 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 21:41:51,139 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 21:41:51,140 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 21:41:51,140 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 21:41:51,141 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 21:41:51,143 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 21:41:51,144 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 21:41:51,145 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 21:41:51,145 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 21:41:51,147 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 21:41:51,147 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 21:41:51,147 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 21:41:51,148 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 21:41:51,149 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 21:41:51,149 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 21:41:51,150 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 21:41:51,151 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 21:41:51,151 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 21:41:51,151 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 21:41:51,151 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 21:41:51,151 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 21:41:51,152 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 21:41:51,152 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 21:41:51,153 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ec6af3e5-5c2a-4ade-81b7-f9f6e64d70ec/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-02 21:41:51,163 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 21:41:51,163 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 21:41:51,164 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 21:41:51,164 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 21:41:51,164 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 21:41:51,165 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 21:41:51,165 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 21:41:51,165 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 21:41:51,165 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 21:41:51,165 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 21:41:51,165 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 21:41:51,165 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 21:41:51,165 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 21:41:51,166 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 21:41:51,166 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 21:41:51,166 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 21:41:51,166 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 21:41:51,166 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 21:41:51,166 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 21:41:51,166 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 21:41:51,167 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 21:41:51,167 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 21:41:51,167 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 21:41:51,167 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 21:41:51,167 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 21:41:51,167 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 21:41:51,167 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 21:41:51,167 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 21:41:51,167 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 21:41:51,167 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 21:41:51,167 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 21:41:51,168 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 21:41:51,168 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 21:41:51,168 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 21:41:51,168 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 21:41:51,168 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 21:41:51,168 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_ec6af3e5-5c2a-4ade-81b7-f9f6e64d70ec/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 -> 37ce12f320cb92b62d01decbfb4f63ee1143a42a [2018-12-02 21:41:51,190 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 21:41:51,199 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 21:41:51,201 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 21:41:51,202 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 21:41:51,203 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 21:41:51,203 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ec6af3e5-5c2a-4ade-81b7-f9f6e64d70ec/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-12-02 21:41:51,245 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ec6af3e5-5c2a-4ade-81b7-f9f6e64d70ec/bin-2019/utaipan/data/0547b13fa/84f8df6242a24848aba6f97bae3a2259/FLAGa47931bf3 [2018-12-02 21:41:51,655 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 21:41:51,655 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ec6af3e5-5c2a-4ade-81b7-f9f6e64d70ec/sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-12-02 21:41:51,661 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ec6af3e5-5c2a-4ade-81b7-f9f6e64d70ec/bin-2019/utaipan/data/0547b13fa/84f8df6242a24848aba6f97bae3a2259/FLAGa47931bf3 [2018-12-02 21:41:51,670 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ec6af3e5-5c2a-4ade-81b7-f9f6e64d70ec/bin-2019/utaipan/data/0547b13fa/84f8df6242a24848aba6f97bae3a2259 [2018-12-02 21:41:51,673 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 21:41:51,674 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 21:41:51,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 21:41:51,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 21:41:51,677 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 21:41:51,678 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:41:51" (1/1) ... [2018-12-02 21:41:51,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b8167c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:41:51, skipping insertion in model container [2018-12-02 21:41:51,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:41:51" (1/1) ... [2018-12-02 21:41:51,686 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 21:41:51,705 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 21:41:51,850 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:41:51,856 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 21:41:51,918 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:41:51,947 INFO L195 MainTranslator]: Completed translation [2018-12-02 21:41:51,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:41:51 WrapperNode [2018-12-02 21:41:51,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 21:41:51,948 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 21:41:51,948 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 21:41:51,948 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 21:41:51,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:41:51" (1/1) ... [2018-12-02 21:41:51,960 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:41:51" (1/1) ... [2018-12-02 21:41:51,964 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 21:41:51,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 21:41:51,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 21:41:51,964 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 21:41:51,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:41:51" (1/1) ... [2018-12-02 21:41:51,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:41:51" (1/1) ... [2018-12-02 21:41:51,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:41:51" (1/1) ... [2018-12-02 21:41:51,971 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:41:51" (1/1) ... [2018-12-02 21:41:51,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:41:51" (1/1) ... [2018-12-02 21:41:51,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:41:51" (1/1) ... [2018-12-02 21:41:51,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:41:51" (1/1) ... [2018-12-02 21:41:51,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 21:41:51,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 21:41:51,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 21:41:51,980 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 21:41:51,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:41:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec6af3e5-5c2a-4ade-81b7-f9f6e64d70ec/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 21:41:52,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 21:41:52,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 21:41:52,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 21:41:52,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 21:41:52,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 21:41:52,010 INFO L130 BoogieDeclarations]: Found specification of procedure cstrpbrk [2018-12-02 21:41:52,010 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2018-12-02 21:41:52,010 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 21:41:52,010 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 21:41:52,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 21:41:52,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 21:41:52,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 21:41:52,146 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 21:41:52,147 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 21:41:52,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:41:52 BoogieIcfgContainer [2018-12-02 21:41:52,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 21:41:52,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 21:41:52,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 21:41:52,149 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 21:41:52,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:41:51" (1/3) ... [2018-12-02 21:41:52,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b92d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:41:52, skipping insertion in model container [2018-12-02 21:41:52,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:41:51" (2/3) ... [2018-12-02 21:41:52,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b92d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:41:52, skipping insertion in model container [2018-12-02 21:41:52,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:41:52" (3/3) ... [2018-12-02 21:41:52,151 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-12-02 21:41:52,156 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 21:41:52,160 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-12-02 21:41:52,169 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-12-02 21:41:52,184 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 21:41:52,184 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 21:41:52,185 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 21:41:52,185 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 21:41:52,185 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 21:41:52,185 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 21:41:52,185 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 21:41:52,185 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 21:41:52,193 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-12-02 21:41:52,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 21:41:52,198 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:41:52,199 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:41:52,200 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:41:52,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:41:52,203 INFO L82 PathProgramCache]: Analyzing trace with hash -231637233, now seen corresponding path program 1 times [2018-12-02 21:41:52,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:41:52,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:41:52,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:41:52,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:41:52,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:41:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:41:52,300 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 21:41:52,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:41:52,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 21:41:52,302 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:41:52,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:41:52,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:41:52,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:41:52,314 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2018-12-02 21:41:52,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:41:52,355 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-12-02 21:41:52,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:41:52,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 21:41:52,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:41:52,362 INFO L225 Difference]: With dead ends: 38 [2018-12-02 21:41:52,362 INFO L226 Difference]: Without dead ends: 35 [2018-12-02 21:41:52,363 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 21:41:52,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-02 21:41:52,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-02 21:41:52,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-02 21:41:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-12-02 21:41:52,383 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 10 [2018-12-02 21:41:52,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:41:52,384 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-12-02 21:41:52,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:41:52,384 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-12-02 21:41:52,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 21:41:52,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:41:52,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:41:52,384 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:41:52,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:41:52,385 INFO L82 PathProgramCache]: Analyzing trace with hash -231637232, now seen corresponding path program 1 times [2018-12-02 21:41:52,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:41:52,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:41:52,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:41:52,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:41:52,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:41:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:41:52,424 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 21:41:52,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:41:52,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 21:41:52,425 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:41:52,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 21:41:52,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:41:52,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:41:52,426 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2018-12-02 21:41:52,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:41:52,445 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-12-02 21:41:52,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 21:41:52,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-02 21:41:52,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:41:52,446 INFO L225 Difference]: With dead ends: 34 [2018-12-02 21:41:52,446 INFO L226 Difference]: Without dead ends: 34 [2018-12-02 21:41:52,447 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 21:41:52,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-02 21:41:52,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-02 21:41:52,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-02 21:41:52,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-12-02 21:41:52,449 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 10 [2018-12-02 21:41:52,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:41:52,449 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-12-02 21:41:52,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 21:41:52,450 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-12-02 21:41:52,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 21:41:52,450 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:41:52,450 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:41:52,450 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:41:52,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:41:52,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1409180402, now seen corresponding path program 1 times [2018-12-02 21:41:52,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:41:52,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:41:52,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:41:52,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:41:52,452 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:41:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:41:52,476 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 21:41:52,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:41:52,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 21:41:52,476 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:41:52,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 21:41:52,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:41:52,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:41:52,477 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 3 states. [2018-12-02 21:41:52,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:41:52,488 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-12-02 21:41:52,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:41:52,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-02 21:41:52,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:41:52,489 INFO L225 Difference]: With dead ends: 33 [2018-12-02 21:41:52,489 INFO L226 Difference]: Without dead ends: 33 [2018-12-02 21:41:52,490 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 21:41:52,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-02 21:41:52,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-02 21:41:52,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 21:41:52,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-12-02 21:41:52,492 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 11 [2018-12-02 21:41:52,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:41:52,492 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-12-02 21:41:52,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 21:41:52,492 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-12-02 21:41:52,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 21:41:52,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:41:52,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:41:52,493 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:41:52,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:41:52,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1409180403, now seen corresponding path program 1 times [2018-12-02 21:41:52,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:41:52,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:41:52,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:41:52,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:41:52,494 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:41:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:41:52,529 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 21:41:52,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:41:52,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 21:41:52,529 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:41:52,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 21:41:52,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:41:52,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:41:52,530 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-12-02 21:41:52,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:41:52,541 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-12-02 21:41:52,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 21:41:52,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-02 21:41:52,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:41:52,542 INFO L225 Difference]: With dead ends: 32 [2018-12-02 21:41:52,542 INFO L226 Difference]: Without dead ends: 32 [2018-12-02 21:41:52,542 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 21:41:52,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-02 21:41:52,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-02 21:41:52,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-02 21:41:52,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-12-02 21:41:52,544 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 11 [2018-12-02 21:41:52,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:41:52,544 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-12-02 21:41:52,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 21:41:52,544 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-12-02 21:41:52,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 21:41:52,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:41:52,545 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:41:52,545 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:41:52,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:41:52,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1755107765, now seen corresponding path program 1 times [2018-12-02 21:41:52,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:41:52,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:41:52,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:41:52,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:41:52,546 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:41:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:41:52,587 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 21:41:52,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:41:52,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:41:52,588 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:41:52,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 21:41:52,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 21:41:52,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:41:52,589 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2018-12-02 21:41:52,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:41:52,637 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-12-02 21:41:52,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 21:41:52,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-02 21:41:52,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:41:52,637 INFO L225 Difference]: With dead ends: 31 [2018-12-02 21:41:52,637 INFO L226 Difference]: Without dead ends: 31 [2018-12-02 21:41:52,638 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 21:41:52,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-02 21:41:52,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-02 21:41:52,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-02 21:41:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-12-02 21:41:52,640 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 15 [2018-12-02 21:41:52,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:41:52,640 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-12-02 21:41:52,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 21:41:52,640 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-12-02 21:41:52,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 21:41:52,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:41:52,640 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:41:52,641 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:41:52,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:41:52,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1755107764, now seen corresponding path program 1 times [2018-12-02 21:41:52,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:41:52,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:41:52,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:41:52,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:41:52,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:41:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:41:52,692 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 21:41:52,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:41:52,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 21:41:52,693 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:41:52,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 21:41:52,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 21:41:52,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 21:41:52,693 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 8 states. [2018-12-02 21:41:52,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:41:52,747 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-12-02 21:41:52,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:41:52,748 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-02 21:41:52,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:41:52,748 INFO L225 Difference]: With dead ends: 35 [2018-12-02 21:41:52,748 INFO L226 Difference]: Without dead ends: 35 [2018-12-02 21:41:52,749 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 21:41:52,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-02 21:41:52,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-12-02 21:41:52,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 21:41:52,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-12-02 21:41:52,752 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 15 [2018-12-02 21:41:52,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:41:52,752 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-12-02 21:41:52,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 21:41:52,753 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-12-02 21:41:52,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 21:41:52,753 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:41:52,753 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:41:52,753 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:41:52,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:41:52,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1170982927, now seen corresponding path program 1 times [2018-12-02 21:41:52,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:41:52,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:41:52,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:41:52,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:41:52,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:41:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:41:52,796 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 21:41:52,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:41:52,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 21:41:52,796 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:41:52,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:41:52,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:41:52,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 21:41:52,797 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2018-12-02 21:41:52,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:41:52,856 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-12-02 21:41:52,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:41:52,856 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-12-02 21:41:52,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:41:52,858 INFO L225 Difference]: With dead ends: 37 [2018-12-02 21:41:52,858 INFO L226 Difference]: Without dead ends: 37 [2018-12-02 21:41:52,858 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 21:41:52,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-02 21:41:52,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2018-12-02 21:41:52,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-02 21:41:52,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-12-02 21:41:52,861 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2018-12-02 21:41:52,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:41:52,861 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-12-02 21:41:52,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:41:52,861 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-12-02 21:41:52,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 21:41:52,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:41:52,861 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:41:52,861 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:41:52,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:41:52,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1170982926, now seen corresponding path program 1 times [2018-12-02 21:41:52,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:41:52,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:41:52,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:41:52,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:41:52,862 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:41:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:41:52,920 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 21:41:52,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:41:52,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 21:41:52,921 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:41:52,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 21:41:52,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 21:41:52,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-02 21:41:52,922 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 9 states. [2018-12-02 21:41:52,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:41:52,996 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-12-02 21:41:52,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 21:41:52,997 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-12-02 21:41:52,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:41:52,997 INFO L225 Difference]: With dead ends: 36 [2018-12-02 21:41:52,997 INFO L226 Difference]: Without dead ends: 36 [2018-12-02 21:41:52,997 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 21:41:52,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-02 21:41:52,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-12-02 21:41:52,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-02 21:41:52,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-12-02 21:41:52,999 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 19 [2018-12-02 21:41:52,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:41:52,999 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-12-02 21:41:53,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 21:41:53,000 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-12-02 21:41:53,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 21:41:53,000 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:41:53,000 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] [2018-12-02 21:41:53,000 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:41:53,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:41:53,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1065194465, now seen corresponding path program 1 times [2018-12-02 21:41:53,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:41:53,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:41:53,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:41:53,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:41:53,001 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:41:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:41:53,034 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 21:41:53,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:41:53,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 21:41:53,034 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:41:53,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 21:41:53,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 21:41:53,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 21:41:53,035 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 4 states. [2018-12-02 21:41:53,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:41:53,068 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-12-02 21:41:53,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 21:41:53,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-12-02 21:41:53,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:41:53,068 INFO L225 Difference]: With dead ends: 33 [2018-12-02 21:41:53,068 INFO L226 Difference]: Without dead ends: 28 [2018-12-02 21:41:53,069 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 21:41:53,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-02 21:41:53,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-02 21:41:53,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 21:41:53,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-12-02 21:41:53,070 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2018-12-02 21:41:53,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:41:53,070 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-12-02 21:41:53,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 21:41:53,071 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-12-02 21:41:53,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 21:41:53,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:41:53,071 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 21:41:53,071 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:41:53,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:41:53,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1803415786, now seen corresponding path program 1 times [2018-12-02 21:41:53,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:41:53,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:41:53,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:41:53,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:41:53,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:41:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:41:53,186 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 21:41:53,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:41:53,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 21:41:53,187 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:41:53,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 21:41:53,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 21:41:53,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-02 21:41:53,187 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 10 states. [2018-12-02 21:41:53,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:41:53,258 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-12-02 21:41:53,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 21:41:53,259 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-12-02 21:41:53,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:41:53,259 INFO L225 Difference]: With dead ends: 38 [2018-12-02 21:41:53,260 INFO L226 Difference]: Without dead ends: 28 [2018-12-02 21:41:53,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-12-02 21:41:53,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-02 21:41:53,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-02 21:41:53,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 21:41:53,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-12-02 21:41:53,262 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2018-12-02 21:41:53,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:41:53,262 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-12-02 21:41:53,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 21:41:53,263 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-12-02 21:41:53,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 21:41:53,263 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:41:53,263 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 21:41:53,264 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:41:53,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:41:53,264 INFO L82 PathProgramCache]: Analyzing trace with hash 903203608, now seen corresponding path program 1 times [2018-12-02 21:41:53,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:41:53,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:41:53,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:41:53,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:41:53,265 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:41:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:41:53,436 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 21:41:53,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:41:53,437 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:41:53,437 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-12-02 21:41:53,438 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [7], [8], [10], [11], [16], [20], [21], [24], [27], [46], [51], [55], [59], [60], [63], [70], [71], [72], [74] [2018-12-02 21:41:53,459 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 21:41:53,459 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 21:41:53,566 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 21:41:53,567 INFO L272 AbstractInterpreter]: Visited 22 different actions 27 times. Merged at 5 different actions 5 times. Never widened. Performed 214 root evaluator evaluations with a maximum evaluation depth of 3. Performed 214 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-12-02 21:41:53,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:41:53,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 21:41:53,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:41:53,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec6af3e5-5c2a-4ade-81b7-f9f6e64d70ec/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 21:41:53,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:41:53,584 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:41:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:41:53,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:41:53,647 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 21:41:53,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:41:53,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:41:53,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-02 21:41:53,667 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 21:41:53,669 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 21:41:53,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:41:53,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:41:53,676 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 21:41:53,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-12-02 21:41:53,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-12-02 21:41:53,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-02 21:41:53,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:41:53,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:41:53,722 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 21:41:53,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-12-02 21:41:53,853 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 21:41:53,855 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 21:41:53,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:41:53,868 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 21:41:53,868 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 21:41:53,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:41:53,882 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 21:41:53,882 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-12-02 21:41:53,935 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 21:41:53,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:41:54,171 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 21:41:54,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:41:54,178 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 21:41:54,188 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 21:41:54,188 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:41:54,189 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:41:54,194 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 21:41:54,194 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:39, output treesize:7 [2018-12-02 21:41:54,200 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 21:41:54,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:41:54,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 27 [2018-12-02 21:41:54,214 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:41:54,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 21:41:54,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 21:41:54,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2018-12-02 21:41:54,215 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 20 states. [2018-12-02 21:41:54,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:41:54,744 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-12-02 21:41:54,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 21:41:54,744 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2018-12-02 21:41:54,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:41:54,745 INFO L225 Difference]: With dead ends: 42 [2018-12-02 21:41:54,745 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 21:41:54,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=184, Invalid=1148, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 21:41:54,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 21:41:54,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-12-02 21:41:54,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-02 21:41:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-12-02 21:41:54,748 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 23 [2018-12-02 21:41:54,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:41:54,748 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-12-02 21:41:54,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 21:41:54,749 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-12-02 21:41:54,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 21:41:54,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:41:54,749 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, 1] [2018-12-02 21:41:54,750 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:41:54,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:41:54,750 INFO L82 PathProgramCache]: Analyzing trace with hash -2065374323, now seen corresponding path program 1 times [2018-12-02 21:41:54,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:41:54,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:41:54,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:41:54,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:41:54,751 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:41:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:41:54,836 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 21:41:54,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:41:54,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 21:41:54,836 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:41:54,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 21:41:54,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 21:41:54,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-02 21:41:54,837 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2018-12-02 21:41:54,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:41:54,952 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-12-02 21:41:54,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 21:41:54,952 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-12-02 21:41:54,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:41:54,952 INFO L225 Difference]: With dead ends: 64 [2018-12-02 21:41:54,952 INFO L226 Difference]: Without dead ends: 64 [2018-12-02 21:41:54,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-12-02 21:41:54,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-02 21:41:54,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-12-02 21:41:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-02 21:41:54,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-12-02 21:41:54,956 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 24 [2018-12-02 21:41:54,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:41:54,956 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-12-02 21:41:54,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 21:41:54,957 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-12-02 21:41:54,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 21:41:54,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:41:54,957 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, 1] [2018-12-02 21:41:54,957 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:41:54,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:41:54,958 INFO L82 PathProgramCache]: Analyzing trace with hash 641245071, now seen corresponding path program 1 times [2018-12-02 21:41:54,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:41:54,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:41:54,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:41:54,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:41:54,959 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:41:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:41:55,086 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 21:41:55,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:41:55,086 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:41:55,087 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-02 21:41:55,087 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [7], [8], [11], [16], [20], [21], [23], [24], [29], [33], [46], [51], [57], [59], [60], [63], [70], [71], [72], [74] [2018-12-02 21:41:55,088 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 21:41:55,088 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 21:41:55,116 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 21:41:55,116 INFO L272 AbstractInterpreter]: Visited 23 different actions 28 times. Merged at 5 different actions 5 times. Never widened. Performed 204 root evaluator evaluations with a maximum evaluation depth of 3. Performed 204 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-12-02 21:41:55,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:41:55,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 21:41:55,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:41:55,117 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec6af3e5-5c2a-4ade-81b7-f9f6e64d70ec/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 21:41:55,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:41:55,126 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:41:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:41:55,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:41:55,144 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 21:41:55,145 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 21:41:55,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:41:55,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:41:55,150 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 21:41:55,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-02 21:41:55,262 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 21:41:55,267 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 21:41:55,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 21:41:55,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:41:55,279 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 21:41:55,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-12-02 21:41:55,330 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 21:41:55,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:41:55,541 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 21:41:55,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:41:55,547 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 21:41:55,554 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 21:41:55,555 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 21:41:55,556 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:41:55,560 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 21:41:55,560 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:39, output treesize:7 [2018-12-02 21:41:55,563 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 21:41:55,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:41:55,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2018-12-02 21:41:55,579 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:41:55,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 21:41:55,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 21:41:55,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2018-12-02 21:41:55,579 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 20 states. [2018-12-02 21:41:56,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:41:56,229 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-12-02 21:41:56,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 21:41:56,229 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2018-12-02 21:41:56,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:41:56,229 INFO L225 Difference]: With dead ends: 83 [2018-12-02 21:41:56,230 INFO L226 Difference]: Without dead ends: 83 [2018-12-02 21:41:56,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=222, Invalid=1260, Unknown=0, NotChecked=0, Total=1482 [2018-12-02 21:41:56,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-02 21:41:56,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 72. [2018-12-02 21:41:56,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-02 21:41:56,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-12-02 21:41:56,234 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 24 [2018-12-02 21:41:56,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:41:56,234 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-12-02 21:41:56,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 21:41:56,234 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-12-02 21:41:56,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 21:41:56,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:41:56,235 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, 1] [2018-12-02 21:41:56,235 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:41:56,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:41:56,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1095627218, now seen corresponding path program 2 times [2018-12-02 21:41:56,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:41:56,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:41:56,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:41:56,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:41:56,236 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:41:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:41:56,431 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 21:41:56,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:41:56,431 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:41:56,432 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:41:56,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:41:56,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:41:56,432 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec6af3e5-5c2a-4ade-81b7-f9f6e64d70ec/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 21:41:56,438 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:41:56,438 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:41:56,453 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 21:41:56,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:41:56,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:41:56,489 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 21:41:56,490 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 21:41:56,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:41:56,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:41:56,496 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 21:41:56,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-12-02 21:41:56,965 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 30 treesize of output 24 [2018-12-02 21:41:56,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:41:56,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 35 [2018-12-02 21:41:56,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 21:41:57,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:41:57,038 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 21:41:57,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:43 [2018-12-02 21:41:57,276 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 21:41:57,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:41:57,980 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 44 treesize of output 40 [2018-12-02 21:41:57,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:41:57,990 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 42 treesize of output 40 [2018-12-02 21:41:57,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:41:57,999 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 32 treesize of output 28 [2018-12-02 21:41:58,011 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:41:58,012 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-02 21:41:58,012 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:41:58,015 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:41:58,022 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 34 treesize of output 30 [2018-12-02 21:41:58,034 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:41:58,035 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-02 21:41:58,035 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:41:58,038 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:41:58,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:41:58,044 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:87, output treesize:23 [2018-12-02 21:41:58,088 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 21:41:58,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:41:58,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 16] total 40 [2018-12-02 21:41:58,103 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:41:58,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-02 21:41:58,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-02 21:41:58,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1503, Unknown=0, NotChecked=0, Total=1640 [2018-12-02 21:41:58,104 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 27 states. [2018-12-02 21:41:58,701 WARN L180 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-12-02 21:41:59,443 WARN L180 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2018-12-02 21:42:04,316 WARN L180 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 72 [2018-12-02 21:42:04,813 WARN L180 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2018-12-02 21:42:06,945 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 104 DAG size of output: 74 [2018-12-02 21:42:13,580 WARN L180 SmtUtils]: Spent 3.53 s on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2018-12-02 21:42:19,769 WARN L180 SmtUtils]: Spent 5.10 s on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2018-12-02 21:42:20,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:42:20,959 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-12-02 21:42:20,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 21:42:20,959 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 29 [2018-12-02 21:42:20,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:42:20,959 INFO L225 Difference]: With dead ends: 85 [2018-12-02 21:42:20,959 INFO L226 Difference]: Without dead ends: 85 [2018-12-02 21:42:20,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=531, Invalid=3251, Unknown=0, NotChecked=0, Total=3782 [2018-12-02 21:42:20,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-02 21:42:20,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2018-12-02 21:42:20,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-02 21:42:20,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-12-02 21:42:20,962 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 29 [2018-12-02 21:42:20,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:42:20,962 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-12-02 21:42:20,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-02 21:42:20,962 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-12-02 21:42:20,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 21:42:20,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:42:20,963 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 21:42:20,963 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 21:42:20,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:42:20,963 INFO L82 PathProgramCache]: Analyzing trace with hash 2065768418, now seen corresponding path program 2 times [2018-12-02 21:42:20,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:42:20,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:20,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:42:20,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:20,964 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:42:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:42:21,131 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 21:42:21,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:42:21,131 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:42:21,132 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:42:21,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:42:21,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:42:21,132 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec6af3e5-5c2a-4ade-81b7-f9f6e64d70ec/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 21:42:21,138 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:42:21,138 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:42:21,152 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 21:42:21,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:42:21,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:42:21,176 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 21:42:21,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:42:21,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:42:21,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-02 21:42:21,194 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 21:42:21,196 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 21:42:21,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:42:21,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:42:21,202 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 21:42:21,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-12-02 21:42:21,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-12-02 21:42:21,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-02 21:42:21,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:42:21,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:42:21,238 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 21:42:21,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:42, output treesize:38 [2018-12-02 21:42:21,513 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 21:42:21,515 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 21:42:21,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:42:21,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:42:21,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 35 [2018-12-02 21:42:21,527 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 21:42:21,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:42:21,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:42:21,554 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:59, output treesize:43 [2018-12-02 21:42:21,626 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 21:42:21,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:42:21,995 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 44 treesize of output 40 [2018-12-02 21:42:21,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 21:42:22,007 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 42 treesize of output 40 [2018-12-02 21:42:22,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 21:42:22,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-12-02 21:42:22,040 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:42:22,041 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-02 21:42:22,042 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:42:22,046 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:42:22,056 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 34 treesize of output 30 [2018-12-02 21:42:22,069 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 21:42:22,070 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-02 21:42:22,070 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 21:42:22,073 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:42:22,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 21:42:22,080 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:87, output treesize:23 [2018-12-02 21:42:22,124 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 21:42:22,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:42:22,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 15] total 40 [2018-12-02 21:42:22,139 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:42:22,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-02 21:42:22,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-02 21:42:22,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1497, Unknown=0, NotChecked=0, Total=1640 [2018-12-02 21:42:22,139 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 28 states. [2018-12-02 21:42:26,511 WARN L180 SmtUtils]: Spent 3.99 s on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2018-12-02 21:42:30,517 WARN L180 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2018-12-02 21:42:31,571 WARN L180 SmtUtils]: Spent 943.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 [2018-12-02 21:42:34,978 WARN L180 SmtUtils]: Spent 3.03 s on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2018-12-02 21:42:38,831 WARN L180 SmtUtils]: Spent 3.81 s on a formula simplification. DAG size of input: 94 DAG size of output: 71 [2018-12-02 21:42:44,428 WARN L180 SmtUtils]: Spent 3.20 s on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2018-12-02 21:42:48,907 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2018-12-02 21:42:53,089 WARN L180 SmtUtils]: Spent 3.07 s on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-12-02 21:43:03,293 WARN L180 SmtUtils]: Spent 7.73 s on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2018-12-02 21:43:07,762 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2018-12-02 21:43:17,217 WARN L180 SmtUtils]: Spent 7.39 s on a formula simplification. DAG size of input: 93 DAG size of output: 66 [2018-12-02 21:43:25,967 WARN L180 SmtUtils]: Spent 6.25 s on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2018-12-02 21:43:33,303 WARN L180 SmtUtils]: Spent 6.49 s on a formula simplification. DAG size of input: 98 DAG size of output: 77 [2018-12-02 21:43:39,433 WARN L180 SmtUtils]: Spent 5.35 s on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2018-12-02 21:43:44,831 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2018-12-02 21:43:51,661 WARN L180 SmtUtils]: Spent 4.00 s on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2018-12-02 21:43:56,201 WARN L180 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2018-12-02 21:44:00,127 WARN L180 SmtUtils]: Spent 3.53 s on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2018-12-02 21:44:09,366 WARN L180 SmtUtils]: Spent 9.17 s on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2018-12-02 21:44:13,862 WARN L180 SmtUtils]: Spent 3.86 s on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2018-12-02 21:44:20,376 WARN L180 SmtUtils]: Spent 5.77 s on a formula simplification. DAG size of input: 100 DAG size of output: 77 [2018-12-02 21:44:26,883 WARN L180 SmtUtils]: Spent 5.50 s on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2018-12-02 21:44:27,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:44:27,486 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-12-02 21:44:27,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-02 21:44:27,486 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 31 [2018-12-02 21:44:27,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:44:27,486 INFO L225 Difference]: With dead ends: 60 [2018-12-02 21:44:27,487 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 21:44:27,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 119.3s TimeCoverageRelationStatistics Valid=674, Invalid=4426, Unknown=12, NotChecked=0, Total=5112 [2018-12-02 21:44:27,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 21:44:27,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 21:44:27,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 21:44:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 21:44:27,488 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-12-02 21:44:27,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:44:27,488 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 21:44:27,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-02 21:44:27,488 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 21:44:27,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 21:44:27,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 09:44:27 BoogieIcfgContainer [2018-12-02 21:44:27,491 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 21:44:27,491 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 21:44:27,491 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 21:44:27,491 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 21:44:27,491 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:41:52" (3/4) ... [2018-12-02 21:44:27,493 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 21:44:27,496 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 21:44:27,497 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrpbrk [2018-12-02 21:44:27,497 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 21:44:27,499 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-12-02 21:44:27,499 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-02 21:44:27,499 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-02 21:44:27,522 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ec6af3e5-5c2a-4ade-81b7-f9f6e64d70ec/bin-2019/utaipan/witness.graphml [2018-12-02 21:44:27,522 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 21:44:27,522 INFO L168 Benchmark]: Toolchain (without parser) took 155848.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.9 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -102.7 MB). Peak memory consumption was 89.2 MB. Max. memory is 11.5 GB. [2018-12-02 21:44:27,523 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 21:44:27,523 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -154.1 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2018-12-02 21:44:27,523 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 21:44:27,523 INFO L168 Benchmark]: Boogie Preprocessor took 15.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:44:27,523 INFO L168 Benchmark]: RCFGBuilder took 167.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-02 21:44:27,523 INFO L168 Benchmark]: TraceAbstraction took 155343.33 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 79.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.4 MB). Peak memory consumption was 105.5 MB. Max. memory is 11.5 GB. [2018-12-02 21:44:27,524 INFO L168 Benchmark]: Witness Printer took 30.92 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 21:44:27,525 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 273.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -154.1 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 167.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 155343.33 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 79.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.4 MB). Peak memory consumption was 105.5 MB. Max. memory is 11.5 GB. * Witness Printer took 30.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 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: 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: 563]: 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, 39 locations, 9 error locations. SAFE Result, 155.3s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 149.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 374 SDtfs, 661 SDslu, 1702 SDs, 0 SdLazy, 1809 SolverSat, 162 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 11.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 423 GetRequests, 141 SyntacticMatches, 8 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2008 ImplicationChecksByTransitivity, 142.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 53 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 393 NumberOfCodeBlocks, 393 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 477 ConstructedInterpolants, 50 QuantifiedInterpolants, 140779 SizeOfPredicates, 78 NumberOfNonLiveVariables, 593 ConjunctsInSsa, 165 ConjunctsInUnsatCore, 23 InterpolantComputations, 11 PerfectInterpolantSequences, 8/79 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...