./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_4f6e3644-74eb-41ff-9eb4-066bae8d184a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4f6e3644-74eb-41ff-9eb4-066bae8d184a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4f6e3644-74eb-41ff-9eb4-066bae8d184a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4f6e3644-74eb-41ff-9eb4-066bae8d184a/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_4f6e3644-74eb-41ff-9eb4-066bae8d184a/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4f6e3644-74eb-41ff-9eb4-066bae8d184a/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-09 09:49:08,611 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 09:49:08,612 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 09:49:08,618 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 09:49:08,618 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 09:49:08,619 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 09:49:08,619 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 09:49:08,620 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 09:49:08,621 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 09:49:08,621 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 09:49:08,622 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 09:49:08,622 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 09:49:08,623 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 09:49:08,623 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 09:49:08,624 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 09:49:08,624 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 09:49:08,624 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 09:49:08,625 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 09:49:08,626 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 09:49:08,627 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 09:49:08,628 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 09:49:08,628 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 09:49:08,629 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 09:49:08,629 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 09:49:08,630 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 09:49:08,630 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 09:49:08,630 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 09:49:08,631 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 09:49:08,631 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 09:49:08,632 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 09:49:08,632 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 09:49:08,632 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 09:49:08,633 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 09:49:08,633 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 09:49:08,633 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 09:49:08,633 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 09:49:08,634 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4f6e3644-74eb-41ff-9eb4-066bae8d184a/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 09:49:08,641 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 09:49:08,641 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 09:49:08,641 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 09:49:08,641 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 09:49:08,641 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 09:49:08,642 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 09:49:08,642 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 09:49:08,642 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 09:49:08,642 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 09:49:08,642 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 09:49:08,642 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 09:49:08,642 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 09:49:08,642 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 09:49:08,642 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 09:49:08,643 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 09:49:08,643 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 09:49:08,643 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 09:49:08,643 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 09:49:08,643 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 09:49:08,643 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 09:49:08,643 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 09:49:08,643 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 09:49:08,643 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 09:49:08,643 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 09:49:08,643 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 09:49:08,643 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 09:49:08,644 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 09:49:08,644 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 09:49:08,644 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 09:49:08,644 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 09:49:08,644 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:49:08,644 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 09:49:08,644 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 09:49:08,644 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 09:49:08,644 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 09:49:08,644 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 09:49:08,645 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_4f6e3644-74eb-41ff-9eb4-066bae8d184a/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-09 09:49:08,661 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 09:49:08,668 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 09:49:08,670 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 09:49:08,671 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 09:49:08,671 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 09:49:08,671 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4f6e3644-74eb-41ff-9eb4-066bae8d184a/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-12-09 09:49:08,706 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4f6e3644-74eb-41ff-9eb4-066bae8d184a/bin-2019/utaipan/data/2132e160f/01fba20fe0ad4da1b7ac3d0d56766f44/FLAG58dee479f [2018-12-09 09:49:09,120 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 09:49:09,121 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4f6e3644-74eb-41ff-9eb4-066bae8d184a/sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-12-09 09:49:09,126 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4f6e3644-74eb-41ff-9eb4-066bae8d184a/bin-2019/utaipan/data/2132e160f/01fba20fe0ad4da1b7ac3d0d56766f44/FLAG58dee479f [2018-12-09 09:49:09,134 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4f6e3644-74eb-41ff-9eb4-066bae8d184a/bin-2019/utaipan/data/2132e160f/01fba20fe0ad4da1b7ac3d0d56766f44 [2018-12-09 09:49:09,136 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 09:49:09,136 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 09:49:09,137 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 09:49:09,137 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 09:49:09,139 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 09:49:09,139 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:49:09" (1/1) ... [2018-12-09 09:49:09,141 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 09.12 09:49:09, skipping insertion in model container [2018-12-09 09:49:09,141 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:49:09" (1/1) ... [2018-12-09 09:49:09,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 09:49:09,161 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 09:49:09,301 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:49:09,308 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 09:49:09,368 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:49:09,388 INFO L195 MainTranslator]: Completed translation [2018-12-09 09:49:09,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:49:09 WrapperNode [2018-12-09 09:49:09,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 09:49:09,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 09:49:09,389 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 09:49:09,389 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 09:49:09,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:49:09" (1/1) ... [2018-12-09 09:49:09,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:49:09" (1/1) ... [2018-12-09 09:49:09,410 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 09:49:09,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 09:49:09,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 09:49:09,410 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 09:49:09,415 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:49:09" (1/1) ... [2018-12-09 09:49:09,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:49:09" (1/1) ... [2018-12-09 09:49:09,418 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:49:09" (1/1) ... [2018-12-09 09:49:09,418 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:49:09" (1/1) ... [2018-12-09 09:49:09,424 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:49:09" (1/1) ... [2018-12-09 09:49:09,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:49:09" (1/1) ... [2018-12-09 09:49:09,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:49:09" (1/1) ... [2018-12-09 09:49:09,429 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 09:49:09,430 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 09:49:09,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 09:49:09,430 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 09:49:09,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:49:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f6e3644-74eb-41ff-9eb4-066bae8d184a/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:49:09,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 09:49:09,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 09:49:09,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 09:49:09,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 09:49:09,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 09:49:09,464 INFO L130 BoogieDeclarations]: Found specification of procedure cstrpbrk [2018-12-09 09:49:09,464 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2018-12-09 09:49:09,464 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 09:49:09,464 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 09:49:09,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 09:49:09,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 09:49:09,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 09:49:09,613 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 09:49:09,614 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 09:49:09,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:49:09 BoogieIcfgContainer [2018-12-09 09:49:09,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 09:49:09,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 09:49:09,615 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 09:49:09,616 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 09:49:09,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 09:49:09" (1/3) ... [2018-12-09 09:49:09,617 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 09.12 09:49:09, skipping insertion in model container [2018-12-09 09:49:09,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:49:09" (2/3) ... [2018-12-09 09:49:09,617 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 09.12 09:49:09, skipping insertion in model container [2018-12-09 09:49:09,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:49:09" (3/3) ... [2018-12-09 09:49:09,619 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-12-09 09:49:09,625 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 09:49:09,629 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-12-09 09:49:09,640 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-12-09 09:49:09,655 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 09:49:09,655 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 09:49:09,655 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 09:49:09,656 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 09:49:09,656 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 09:49:09,656 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 09:49:09,656 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 09:49:09,656 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 09:49:09,664 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-12-09 09:49:09,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 09:49:09,670 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:49:09,670 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:49:09,672 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-09 09:49:09,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:49:09,675 INFO L82 PathProgramCache]: Analyzing trace with hash -231637233, now seen corresponding path program 1 times [2018-12-09 09:49:09,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:49:09,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:49:09,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:49:09,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:49:09,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:49:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:49:09,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:49:09,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:49:09,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 09:49:09,775 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:49:09,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:49:09,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:49:09,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:49:09,787 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2018-12-09 09:49:09,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:49:09,824 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-12-09 09:49:09,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:49:09,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 09:49:09,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:49:09,830 INFO L225 Difference]: With dead ends: 38 [2018-12-09 09:49:09,830 INFO L226 Difference]: Without dead ends: 35 [2018-12-09 09:49:09,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:49:09,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-09 09:49:09,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-09 09:49:09,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-09 09:49:09,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-12-09 09:49:09,852 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 10 [2018-12-09 09:49:09,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:49:09,852 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-12-09 09:49:09,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:49:09,852 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-12-09 09:49:09,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 09:49:09,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:49:09,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:49:09,853 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-09 09:49:09,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:49:09,853 INFO L82 PathProgramCache]: Analyzing trace with hash -231637232, now seen corresponding path program 1 times [2018-12-09 09:49:09,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:49:09,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:49:09,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:49:09,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:49:09,854 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:49:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:49:09,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:49:09,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:49:09,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:49:09,890 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:49:09,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:49:09,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:49:09,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:49:09,892 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2018-12-09 09:49:09,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:49:09,910 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-12-09 09:49:09,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:49:09,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-09 09:49:09,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:49:09,912 INFO L225 Difference]: With dead ends: 34 [2018-12-09 09:49:09,912 INFO L226 Difference]: Without dead ends: 34 [2018-12-09 09:49:09,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:49:09,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-09 09:49:09,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-09 09:49:09,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-09 09:49:09,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-12-09 09:49:09,916 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 10 [2018-12-09 09:49:09,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:49:09,916 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-12-09 09:49:09,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:49:09,917 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-12-09 09:49:09,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 09:49:09,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:49:09,917 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:49:09,917 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-09 09:49:09,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:49:09,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1409180402, now seen corresponding path program 1 times [2018-12-09 09:49:09,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:49:09,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:49:09,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:49:09,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:49:09,919 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:49:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:49:09,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:49:09,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:49:09,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 09:49:09,947 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:49:09,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:49:09,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:49:09,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:49:09,948 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 3 states. [2018-12-09 09:49:09,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:49:09,965 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-12-09 09:49:09,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:49:09,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 09:49:09,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:49:09,965 INFO L225 Difference]: With dead ends: 33 [2018-12-09 09:49:09,966 INFO L226 Difference]: Without dead ends: 33 [2018-12-09 09:49:09,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:49:09,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-09 09:49:09,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-09 09:49:09,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 09:49:09,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-12-09 09:49:09,968 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 11 [2018-12-09 09:49:09,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:49:09,968 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-12-09 09:49:09,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:49:09,969 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-12-09 09:49:09,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 09:49:09,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:49:09,969 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:49:09,969 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-09 09:49:09,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:49:09,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1409180403, now seen corresponding path program 1 times [2018-12-09 09:49:09,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:49:09,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:49:09,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:49:09,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:49:09,970 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:49:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:49:10,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:49:10,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:49:10,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:49:10,000 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:49:10,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:49:10,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:49:10,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:49:10,001 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-12-09 09:49:10,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:49:10,011 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-12-09 09:49:10,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:49:10,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-09 09:49:10,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:49:10,012 INFO L225 Difference]: With dead ends: 32 [2018-12-09 09:49:10,012 INFO L226 Difference]: Without dead ends: 32 [2018-12-09 09:49:10,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:49:10,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-09 09:49:10,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-09 09:49:10,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-09 09:49:10,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-12-09 09:49:10,014 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 11 [2018-12-09 09:49:10,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:49:10,014 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-12-09 09:49:10,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:49:10,015 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-12-09 09:49:10,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 09:49:10,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:49:10,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:49:10,015 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-09 09:49:10,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:49:10,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1755107765, now seen corresponding path program 1 times [2018-12-09 09:49:10,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:49:10,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:49:10,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:49:10,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:49:10,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:49:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:49:10,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:49:10,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:49:10,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:49:10,048 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:49:10,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:49:10,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:49:10,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:49:10,049 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2018-12-09 09:49:10,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:49:10,090 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-12-09 09:49:10,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:49:10,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-09 09:49:10,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:49:10,091 INFO L225 Difference]: With dead ends: 31 [2018-12-09 09:49:10,091 INFO L226 Difference]: Without dead ends: 31 [2018-12-09 09:49:10,091 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-09 09:49:10,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-09 09:49:10,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-09 09:49:10,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-09 09:49:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-12-09 09:49:10,093 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 15 [2018-12-09 09:49:10,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:49:10,093 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-12-09 09:49:10,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:49:10,094 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-12-09 09:49:10,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 09:49:10,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:49:10,094 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:49:10,094 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-09 09:49:10,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:49:10,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1755107764, now seen corresponding path program 1 times [2018-12-09 09:49:10,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:49:10,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:49:10,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:49:10,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:49:10,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:49:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:49:10,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:49:10,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:49:10,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:49:10,175 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:49:10,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 09:49:10,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 09:49:10,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:49:10,176 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 8 states. [2018-12-09 09:49:10,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:49:10,232 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-12-09 09:49:10,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:49:10,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-09 09:49:10,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:49:10,233 INFO L225 Difference]: With dead ends: 35 [2018-12-09 09:49:10,233 INFO L226 Difference]: Without dead ends: 35 [2018-12-09 09:49:10,234 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-09 09:49:10,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-09 09:49:10,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-12-09 09:49:10,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 09:49:10,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-12-09 09:49:10,237 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 15 [2018-12-09 09:49:10,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:49:10,237 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-12-09 09:49:10,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 09:49:10,237 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-12-09 09:49:10,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 09:49:10,238 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:49:10,238 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-09 09:49:10,238 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-09 09:49:10,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:49:10,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1170982927, now seen corresponding path program 1 times [2018-12-09 09:49:10,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:49:10,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:49:10,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:49:10,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:49:10,240 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:49:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:49:10,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:49:10,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:49:10,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:49:10,278 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:49:10,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:49:10,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:49:10,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:49:10,279 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2018-12-09 09:49:10,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:49:10,340 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-12-09 09:49:10,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:49:10,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-12-09 09:49:10,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:49:10,342 INFO L225 Difference]: With dead ends: 37 [2018-12-09 09:49:10,342 INFO L226 Difference]: Without dead ends: 37 [2018-12-09 09:49:10,342 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-09 09:49:10,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-09 09:49:10,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2018-12-09 09:49:10,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-09 09:49:10,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-12-09 09:49:10,344 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2018-12-09 09:49:10,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:49:10,345 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-12-09 09:49:10,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:49:10,345 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-12-09 09:49:10,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 09:49:10,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:49:10,345 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-09 09:49:10,345 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-09 09:49:10,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:49:10,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1170982926, now seen corresponding path program 1 times [2018-12-09 09:49:10,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:49:10,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:49:10,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:49:10,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:49:10,346 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:49:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:49:10,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:49:10,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:49:10,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 09:49:10,421 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:49:10,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 09:49:10,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 09:49:10,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:49:10,421 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 9 states. [2018-12-09 09:49:10,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:49:10,491 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-12-09 09:49:10,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:49:10,492 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-12-09 09:49:10,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:49:10,492 INFO L225 Difference]: With dead ends: 36 [2018-12-09 09:49:10,492 INFO L226 Difference]: Without dead ends: 36 [2018-12-09 09:49:10,492 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-09 09:49:10,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-09 09:49:10,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-12-09 09:49:10,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-09 09:49:10,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-12-09 09:49:10,494 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 19 [2018-12-09 09:49:10,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:49:10,495 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-12-09 09:49:10,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 09:49:10,495 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-12-09 09:49:10,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 09:49:10,495 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:49:10,495 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-09 09:49:10,495 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-09 09:49:10,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:49:10,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1065194465, now seen corresponding path program 1 times [2018-12-09 09:49:10,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:49:10,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:49:10,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:49:10,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:49:10,496 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:49:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:49:10,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:49:10,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:49:10,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:49:10,539 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:49:10,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:49:10,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:49:10,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:49:10,540 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 4 states. [2018-12-09 09:49:10,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:49:10,568 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-12-09 09:49:10,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:49:10,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-12-09 09:49:10,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:49:10,569 INFO L225 Difference]: With dead ends: 33 [2018-12-09 09:49:10,569 INFO L226 Difference]: Without dead ends: 28 [2018-12-09 09:49:10,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:49:10,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-09 09:49:10,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-09 09:49:10,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-09 09:49:10,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-12-09 09:49:10,571 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2018-12-09 09:49:10,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:49:10,571 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-12-09 09:49:10,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:49:10,571 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-12-09 09:49:10,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 09:49:10,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:49:10,571 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-09 09:49:10,571 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-09 09:49:10,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:49:10,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1803415786, now seen corresponding path program 1 times [2018-12-09 09:49:10,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:49:10,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:49:10,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:49:10,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:49:10,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:49:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:49:10,673 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-09 09:49:10,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:49:10,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 09:49:10,673 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:49:10,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 09:49:10,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 09:49:10,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-09 09:49:10,674 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 10 states. [2018-12-09 09:49:10,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:49:10,747 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-12-09 09:49:10,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 09:49:10,747 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-12-09 09:49:10,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:49:10,748 INFO L225 Difference]: With dead ends: 38 [2018-12-09 09:49:10,748 INFO L226 Difference]: Without dead ends: 28 [2018-12-09 09:49:10,748 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-09 09:49:10,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-09 09:49:10,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-09 09:49:10,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-09 09:49:10,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-12-09 09:49:10,750 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2018-12-09 09:49:10,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:49:10,750 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-12-09 09:49:10,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 09:49:10,750 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-12-09 09:49:10,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 09:49:10,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:49:10,750 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-09 09:49:10,750 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-09 09:49:10,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:49:10,751 INFO L82 PathProgramCache]: Analyzing trace with hash 903203608, now seen corresponding path program 1 times [2018-12-09 09:49:10,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:49:10,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:49:10,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:49:10,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:49:10,751 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:49:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:49:10,906 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-09 09:49:10,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:49:10,906 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:49:10,907 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-12-09 09:49:10,908 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-09 09:49:10,935 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:49:10,935 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:49:11,056 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:49:11,057 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-09 09:49:11,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:49:11,062 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:49:11,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:49:11,062 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f6e3644-74eb-41ff-9eb4-066bae8d184a/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:49:11,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:49:11,070 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:49:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:49:11,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:49:11,122 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-09 09:49:11,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:49:11,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:49:11,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-09 09:49:11,150 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-09 09:49:11,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 09:49:11,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:49:11,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:49:11,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:49:11,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-12-09 09:49:11,194 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-09 09:49:11,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-09 09:49:11,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:49:11,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:49:11,210 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-09 09:49:11,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-12-09 09:49:11,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-12-09 09:49:11,349 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-09 09:49:11,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:49:11,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 09:49:11,359 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 09:49:11,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:49:11,373 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-09 09:49:11,373 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-12-09 09:49:11,442 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-09 09:49:11,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:49:11,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-09 09:49:11,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:49:11,676 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-09 09:49:11,684 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-09 09:49:11,684 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:49:11,685 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:49:11,689 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-09 09:49:11,689 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:39, output treesize:7 [2018-12-09 09:49:11,695 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-09 09:49:11,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:49:11,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 27 [2018-12-09 09:49:11,709 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:49:11,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 09:49:11,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 09:49:11,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2018-12-09 09:49:11,710 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 20 states. [2018-12-09 09:49:12,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:49:12,249 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-12-09 09:49:12,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 09:49:12,250 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2018-12-09 09:49:12,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:49:12,250 INFO L225 Difference]: With dead ends: 42 [2018-12-09 09:49:12,251 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 09:49:12,251 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-09 09:49:12,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 09:49:12,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-12-09 09:49:12,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 09:49:12,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-12-09 09:49:12,253 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 23 [2018-12-09 09:49:12,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:49:12,253 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-12-09 09:49:12,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 09:49:12,253 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-12-09 09:49:12,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 09:49:12,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:49:12,253 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-09 09:49:12,254 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-09 09:49:12,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:49:12,254 INFO L82 PathProgramCache]: Analyzing trace with hash -2065374323, now seen corresponding path program 1 times [2018-12-09 09:49:12,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:49:12,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:49:12,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:49:12,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:49:12,255 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:49:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:49:12,339 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-09 09:49:12,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:49:12,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 09:49:12,340 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:49:12,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 09:49:12,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 09:49:12,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-09 09:49:12,340 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2018-12-09 09:49:12,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:49:12,448 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-12-09 09:49:12,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 09:49:12,448 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-12-09 09:49:12,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:49:12,449 INFO L225 Difference]: With dead ends: 64 [2018-12-09 09:49:12,449 INFO L226 Difference]: Without dead ends: 64 [2018-12-09 09:49:12,449 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-09 09:49:12,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-09 09:49:12,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-12-09 09:49:12,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-09 09:49:12,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-12-09 09:49:12,452 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 24 [2018-12-09 09:49:12,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:49:12,452 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-12-09 09:49:12,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 09:49:12,452 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-12-09 09:49:12,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 09:49:12,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:49:12,453 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-09 09:49:12,453 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-09 09:49:12,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:49:12,453 INFO L82 PathProgramCache]: Analyzing trace with hash 641245071, now seen corresponding path program 1 times [2018-12-09 09:49:12,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:49:12,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:49:12,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:49:12,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:49:12,454 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:49:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:49:12,584 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-09 09:49:12,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:49:12,584 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:49:12,584 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-09 09:49:12,584 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-09 09:49:12,585 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 09:49:12,585 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 09:49:12,620 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 09:49:12,620 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-09 09:49:12,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:49:12,621 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 09:49:12,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:49:12,621 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f6e3644-74eb-41ff-9eb4-066bae8d184a/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 09:49:12,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:49:12,627 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 09:49:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:49:12,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:49:12,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 09:49:12,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 09:49:12,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:49:12,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:49:12,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:49:12,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 09:49:12,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-09 09:49:12,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 09:49:12,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 09:49:12,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:49:12,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:49:12,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-12-09 09:49:12,830 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-09 09:49:12,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:49:13,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-09 09:49:13,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:49:13,064 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-09 09:49:13,071 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-09 09:49:13,071 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 09:49:13,072 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:49:13,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:49:13,077 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:39, output treesize:7 [2018-12-09 09:49:13,081 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-09 09:49:13,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:49:13,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2018-12-09 09:49:13,106 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:49:13,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 09:49:13,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 09:49:13,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2018-12-09 09:49:13,107 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 20 states. [2018-12-09 09:49:13,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:49:13,988 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-12-09 09:49:13,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 09:49:13,989 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2018-12-09 09:49:13,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:49:13,989 INFO L225 Difference]: With dead ends: 83 [2018-12-09 09:49:13,990 INFO L226 Difference]: Without dead ends: 83 [2018-12-09 09:49:13,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=222, Invalid=1260, Unknown=0, NotChecked=0, Total=1482 [2018-12-09 09:49:13,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-09 09:49:13,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 72. [2018-12-09 09:49:13,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-09 09:49:13,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-12-09 09:49:13,994 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 24 [2018-12-09 09:49:13,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:49:13,994 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-12-09 09:49:13,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 09:49:13,994 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-12-09 09:49:13,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 09:49:13,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:49:13,995 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-09 09:49:13,995 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-09 09:49:13,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:49:13,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1095627218, now seen corresponding path program 2 times [2018-12-09 09:49:13,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:49:13,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:49:13,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:49:13,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:49:13,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:49:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:49:14,203 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-09 09:49:14,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:49:14,204 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:49:14,204 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:49:14,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:49:14,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:49:14,204 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f6e3644-74eb-41ff-9eb4-066bae8d184a/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-09 09:49:14,210 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 09:49:14,210 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 09:49:14,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 09:49:14,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 09:49:14,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:49:14,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 09:49:14,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 09:49:14,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:49:14,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:49:14,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:49:14,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-12-09 09:49:14,794 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-09 09:49:14,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:49:14,811 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-09 09:49:14,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 09:49:14,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:49:14,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:49:14,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:43 [2018-12-09 09:49:15,039 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-09 09:49:15,040 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:49:15,574 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-09 09:49:15,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:49:15,585 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-09 09:49:15,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:49:15,594 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-09 09:49:15,606 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:49:15,607 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-09 09:49:15,607 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:49:15,610 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:49:15,617 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-09 09:49:15,629 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:49:15,630 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-09 09:49:15,631 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 09:49:15,634 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:49:15,640 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-09 09:49:15,640 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:87, output treesize:23 [2018-12-09 09:49:15,686 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-09 09:49:15,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:49:15,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 16] total 40 [2018-12-09 09:49:15,702 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:49:15,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-09 09:49:15,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-09 09:49:15,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1503, Unknown=0, NotChecked=0, Total=1640 [2018-12-09 09:49:15,703 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 27 states. [2018-12-09 09:49:16,377 WARN L180 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-12-09 09:49:17,083 WARN L180 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2018-12-09 09:49:23,719 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 99 DAG size of output: 72 [2018-12-09 09:49:24,179 WARN L180 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2018-12-09 09:49:26,724 WARN L180 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 74 [2018-12-09 09:49:27,456 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2018-12-09 09:49:33,728 WARN L180 SmtUtils]: Spent 5.15 s on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2018-12-09 09:49:41,667 WARN L180 SmtUtils]: Spent 6.49 s on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2018-12-09 09:49:42,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:49:42,145 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-12-09 09:49:42,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 09:49:42,146 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 29 [2018-12-09 09:49:42,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:49:42,146 INFO L225 Difference]: With dead ends: 85 [2018-12-09 09:49:42,146 INFO L226 Difference]: Without dead ends: 85 [2018-12-09 09:49:42,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=530, Invalid=3251, Unknown=1, NotChecked=0, Total=3782 [2018-12-09 09:49:42,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-09 09:49:42,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2018-12-09 09:49:42,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-09 09:49:42,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-12-09 09:49:42,149 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 29 [2018-12-09 09:49:42,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:49:42,149 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-12-09 09:49:42,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-09 09:49:42,149 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-12-09 09:49:42,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 09:49:42,150 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:49:42,150 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-09 09:49:42,150 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-09 09:49:42,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:49:42,150 INFO L82 PathProgramCache]: Analyzing trace with hash 2065768418, now seen corresponding path program 2 times [2018-12-09 09:49:42,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:49:42,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:49:42,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:49:42,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:49:42,150 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:49:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:49:42,318 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-09 09:49:42,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:49:42,318 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 09:49:42,318 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 09:49:42,318 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 09:49:42,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 09:49:42,318 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f6e3644-74eb-41ff-9eb4-066bae8d184a/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-09 09:49:42,326 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 09:49:42,326 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 09:49:42,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 09:49:42,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 09:49:42,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:49:42,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-09 09:49:42,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:49:42,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:49:42,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-09 09:49:42,387 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-09 09:49:42,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 09:49:42,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:49:42,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:49:42,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 09:49:42,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-12-09 09:49:42,418 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-09 09:49:42,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 09:49:42,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:49:42,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:49:42,430 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-09 09:49:42,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:42, output treesize:38 [2018-12-09 09:49:42,986 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-09 09:49:42,988 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-09 09:49:42,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:49:42,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 09:49:42,998 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-09 09:49:42,998 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 09:49:43,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 09:49:43,016 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-09 09:49:43,016 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:59, output treesize:43 [2018-12-09 09:49:43,084 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 10 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:49:43,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:49:43,454 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-09 09:49:43,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 09:49:43,466 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-09 09:49:43,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 09:49:43,476 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-09 09:49:43,489 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:49:43,490 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-09 09:49:43,490 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 09:49:43,493 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:49:43,501 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-09 09:49:43,513 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 09:49:43,514 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-09 09:49:43,515 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 09:49:43,518 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 09:49:43,524 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-09 09:49:43,524 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:87, output treesize:23 [2018-12-09 09:49:43,571 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-09 09:49:43,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 09:49:43,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 15] total 40 [2018-12-09 09:49:43,586 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 09:49:43,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-09 09:49:43,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-09 09:49:43,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1497, Unknown=1, NotChecked=0, Total=1640 [2018-12-09 09:49:43,587 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 28 states. [2018-12-09 09:49:45,380 WARN L180 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2018-12-09 09:49:45,767 WARN L180 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2018-12-09 09:49:53,003 WARN L180 SmtUtils]: Spent 7.14 s on a formula simplification. DAG size of input: 92 DAG size of output: 69 [2018-12-09 09:49:56,380 WARN L180 SmtUtils]: Spent 3.08 s on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2018-12-09 09:50:01,227 WARN L180 SmtUtils]: Spent 4.81 s on a formula simplification. DAG size of input: 94 DAG size of output: 71 [2018-12-09 09:50:04,880 WARN L180 SmtUtils]: Spent 3.24 s on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2018-12-09 09:50:09,387 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2018-12-09 09:50:14,291 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-12-09 09:50:17,921 WARN L180 SmtUtils]: Spent 3.56 s on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2018-12-09 09:50:19,410 WARN L180 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2018-12-09 09:50:34,553 WARN L180 SmtUtils]: Spent 13.08 s on a formula simplification. DAG size of input: 100 DAG size of output: 75 [2018-12-09 09:50:39,175 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 93 DAG size of output: 75 [2018-12-09 09:50:50,441 WARN L180 SmtUtils]: Spent 11.21 s on a formula simplification. DAG size of input: 105 DAG size of output: 77 [2018-12-09 09:50:54,983 WARN L180 SmtUtils]: Spent 3.75 s on a formula simplification. DAG size of input: 98 DAG size of output: 77 [2018-12-09 09:51:00,788 WARN L180 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2018-12-09 09:51:05,064 WARN L180 SmtUtils]: Spent 3.25 s on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2018-12-09 09:51:08,885 WARN L180 SmtUtils]: Spent 3.74 s on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2018-12-09 09:51:10,393 WARN L180 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2018-12-09 09:51:16,804 WARN L180 SmtUtils]: Spent 5.72 s on a formula simplification. DAG size of input: 102 DAG size of output: 72 [2018-12-09 09:51:25,435 WARN L180 SmtUtils]: Spent 6.58 s on a formula simplification. DAG size of input: 95 DAG size of output: 69 [2018-12-09 09:51:37,026 WARN L180 SmtUtils]: Spent 10.88 s on a formula simplification. DAG size of input: 107 DAG size of output: 77 [2018-12-09 09:51:41,699 WARN L180 SmtUtils]: Spent 3.06 s on a formula simplification. DAG size of input: 100 DAG size of output: 71 [2018-12-09 09:51:42,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:51:42,794 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-12-09 09:51:42,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-09 09:51:42,794 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 31 [2018-12-09 09:51:42,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:51:42,794 INFO L225 Difference]: With dead ends: 60 [2018-12-09 09:51:42,794 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 09:51:42,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 116.8s TimeCoverageRelationStatistics Valid=680, Invalid=4426, Unknown=6, NotChecked=0, Total=5112 [2018-12-09 09:51:42,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 09:51:42,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 09:51:42,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 09:51:42,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 09:51:42,796 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-12-09 09:51:42,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:51:42,796 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 09:51:42,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-09 09:51:42,796 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 09:51:42,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 09:51:42,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 09:51:42 BoogieIcfgContainer [2018-12-09 09:51:42,799 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 09:51:42,800 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 09:51:42,800 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 09:51:42,800 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 09:51:42,800 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:49:09" (3/4) ... [2018-12-09 09:51:42,802 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 09:51:42,805 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 09:51:42,805 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrpbrk [2018-12-09 09:51:42,805 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 09:51:42,808 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-12-09 09:51:42,808 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-09 09:51:42,808 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 09:51:42,834 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4f6e3644-74eb-41ff-9eb4-066bae8d184a/bin-2019/utaipan/witness.graphml [2018-12-09 09:51:42,834 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 09:51:42,835 INFO L168 Benchmark]: Toolchain (without parser) took 153698.70 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 273.2 MB). Free memory was 952.4 MB in the beginning and 1.2 GB in the end (delta: -203.7 MB). Peak memory consumption was 69.5 MB. Max. memory is 11.5 GB. [2018-12-09 09:51:42,835 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:51:42,835 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -123.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-09 09:51:42,835 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.24 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-09 09:51:42,835 INFO L168 Benchmark]: Boogie Preprocessor took 19.40 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-09 09:51:42,835 INFO L168 Benchmark]: RCFGBuilder took 184.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2018-12-09 09:51:42,836 INFO L168 Benchmark]: TraceAbstraction took 153184.85 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 179.8 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -106.3 MB). Peak memory consumption was 73.5 MB. Max. memory is 11.5 GB. [2018-12-09 09:51:42,836 INFO L168 Benchmark]: Witness Printer took 34.55 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:51:42,837 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 251.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -123.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.24 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. * Boogie Preprocessor took 19.40 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 184.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 153184.85 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 179.8 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -106.3 MB). Peak memory consumption was 73.5 MB. Max. memory is 11.5 GB. * Witness Printer took 34.55 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 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, 153.1s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 147.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 371 SDtfs, 659 SDslu, 1669 SDs, 0 SdLazy, 1750 SolverSat, 162 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 423 GetRequests, 141 SyntacticMatches, 8 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2002 ImplicationChecksByTransitivity, 145.3s 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.8s InterpolantComputationTime, 393 NumberOfCodeBlocks, 393 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 477 ConstructedInterpolants, 50 QuantifiedInterpolants, 140779 SizeOfPredicates, 78 NumberOfNonLiveVariables, 593 ConjunctsInSsa, 165 ConjunctsInUnsatCore, 23 InterpolantComputations, 11 PerfectInterpolantSequences, 7/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...