./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/length_test03_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/length_test03_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/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 7db66fa755812d372ccac4d56a0ec85104dbcc6e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/length_test03_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/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 7db66fa755812d372ccac4d56a0ec85104dbcc6e ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: v_prenex_95 term size 44 --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 08:47:15,293 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:47:15,295 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:47:15,303 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:47:15,303 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:47:15,304 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:47:15,305 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:47:15,306 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:47:15,307 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:47:15,308 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:47:15,308 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:47:15,309 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:47:15,309 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:47:15,310 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:47:15,311 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:47:15,311 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:47:15,312 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:47:15,313 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:47:15,314 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:47:15,315 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:47:15,316 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:47:15,316 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:47:15,318 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:47:15,318 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:47:15,318 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:47:15,319 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:47:15,319 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:47:15,320 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:47:15,320 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:47:15,321 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:47:15,321 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:47:15,322 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:47:15,322 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:47:15,322 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:47:15,323 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:47:15,323 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:47:15,323 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-18 08:47:15,333 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:47:15,333 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:47:15,334 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 08:47:15,334 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 08:47:15,334 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 08:47:15,334 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 08:47:15,334 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 08:47:15,334 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 08:47:15,335 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 08:47:15,335 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 08:47:15,335 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 08:47:15,335 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 08:47:15,335 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 08:47:15,336 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 08:47:15,336 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 08:47:15,336 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:47:15,336 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 08:47:15,336 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 08:47:15,336 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 08:47:15,336 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 08:47:15,336 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:47:15,337 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-18 08:47:15,337 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-18 08:47:15,337 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-18 08:47:15,337 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 08:47:15,337 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 08:47:15,337 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:47:15,337 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:47:15,337 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 08:47:15,338 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 08:47:15,338 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 08:47:15,338 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 08:47:15,338 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:47:15,338 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 08:47:15,338 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 08:47:15,338 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 08:47:15,338 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 08:47:15,339 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_d724eca7-8055-4f38-9145-657f11e95167/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 -> 7db66fa755812d372ccac4d56a0ec85104dbcc6e [2018-11-18 08:47:15,362 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:47:15,372 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:47:15,374 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:47:15,375 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:47:15,376 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:47:15,376 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/../../sv-benchmarks/c/memsafety-ext2/length_test03_true-valid-memsafety.i [2018-11-18 08:47:15,419 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/data/6e58aad8d/6a523d3048da47afb578940edd4bbf21/FLAG79a9b8e1e [2018-11-18 08:47:15,786 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:47:15,787 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/sv-benchmarks/c/memsafety-ext2/length_test03_true-valid-memsafety.i [2018-11-18 08:47:15,796 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/data/6e58aad8d/6a523d3048da47afb578940edd4bbf21/FLAG79a9b8e1e [2018-11-18 08:47:16,177 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/data/6e58aad8d/6a523d3048da47afb578940edd4bbf21 [2018-11-18 08:47:16,179 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:47:16,180 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 08:47:16,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:47:16,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:47:16,183 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:47:16,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:47:16" (1/1) ... [2018-11-18 08:47:16,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bac6eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:16, skipping insertion in model container [2018-11-18 08:47:16,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:47:16" (1/1) ... [2018-11-18 08:47:16,192 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:47:16,222 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:47:16,412 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:47:16,420 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:47:16,451 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:47:16,526 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:47:16,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:16 WrapperNode [2018-11-18 08:47:16,526 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:47:16,527 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 08:47:16,527 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 08:47:16,527 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 08:47:16,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:16" (1/1) ... [2018-11-18 08:47:16,542 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:16" (1/1) ... [2018-11-18 08:47:16,547 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 08:47:16,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:47:16,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:47:16,547 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:47:16,553 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:16" (1/1) ... [2018-11-18 08:47:16,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:16" (1/1) ... [2018-11-18 08:47:16,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:16" (1/1) ... [2018-11-18 08:47:16,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:16" (1/1) ... [2018-11-18 08:47:16,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:16" (1/1) ... [2018-11-18 08:47:16,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:16" (1/1) ... [2018-11-18 08:47:16,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:16" (1/1) ... [2018-11-18 08:47:16,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:47:16,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:47:16,573 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:47:16,574 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:47:16,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/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-11-18 08:47:16,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 08:47:16,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 08:47:16,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 08:47:16,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 08:47:16,612 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 08:47:16,612 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 08:47:16,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 08:47:16,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 08:47:16,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 08:47:16,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:47:16,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:47:16,613 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-11-18 08:47:16,613 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-11-18 08:47:16,958 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:47:16,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:47:16 BoogieIcfgContainer [2018-11-18 08:47:16,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:47:16,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 08:47:16,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 08:47:16,961 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 08:47:16,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:47:16" (1/3) ... [2018-11-18 08:47:16,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3966ac5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:47:16, skipping insertion in model container [2018-11-18 08:47:16,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:16" (2/3) ... [2018-11-18 08:47:16,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3966ac5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:47:16, skipping insertion in model container [2018-11-18 08:47:16,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:47:16" (3/3) ... [2018-11-18 08:47:16,965 INFO L112 eAbstractionObserver]: Analyzing ICFG length_test03_true-valid-memsafety.i [2018-11-18 08:47:16,971 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 08:47:16,976 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-11-18 08:47:16,985 INFO L257 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2018-11-18 08:47:17,002 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 08:47:17,003 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-18 08:47:17,003 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 08:47:17,003 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 08:47:17,003 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 08:47:17,003 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 08:47:17,003 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 08:47:17,003 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 08:47:17,014 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states. [2018-11-18 08:47:17,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 08:47:17,022 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:47:17,023 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:47:17,025 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-11-18 08:47:17,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:17,029 INFO L82 PathProgramCache]: Analyzing trace with hash -963964013, now seen corresponding path program 1 times [2018-11-18 08:47:17,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:47:17,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:47:17,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:17,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:47:17,060 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:47:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:17,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:17,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:47:17,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 08:47:17,126 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:47:17,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:47:17,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:47:17,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:47:17,139 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 3 states. [2018-11-18 08:47:17,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:47:17,280 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2018-11-18 08:47:17,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:47:17,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-18 08:47:17,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:47:17,289 INFO L225 Difference]: With dead ends: 161 [2018-11-18 08:47:17,289 INFO L226 Difference]: Without dead ends: 158 [2018-11-18 08:47:17,291 INFO L604 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-11-18 08:47:17,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-18 08:47:17,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 123. [2018-11-18 08:47:17,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-18 08:47:17,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2018-11-18 08:47:17,322 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 7 [2018-11-18 08:47:17,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:47:17,323 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2018-11-18 08:47:17,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:47:17,323 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2018-11-18 08:47:17,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 08:47:17,323 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:47:17,323 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:47:17,323 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-11-18 08:47:17,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:17,324 INFO L82 PathProgramCache]: Analyzing trace with hash -963964012, now seen corresponding path program 1 times [2018-11-18 08:47:17,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:47:17,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:47:17,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:17,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:47:17,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:47:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:17,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:17,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:47:17,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 08:47:17,355 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:47:17,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:47:17,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:47:17,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:47:17,357 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand 3 states. [2018-11-18 08:47:17,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:47:17,473 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2018-11-18 08:47:17,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:47:17,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-18 08:47:17,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:47:17,475 INFO L225 Difference]: With dead ends: 123 [2018-11-18 08:47:17,475 INFO L226 Difference]: Without dead ends: 123 [2018-11-18 08:47:17,476 INFO L604 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-11-18 08:47:17,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-18 08:47:17,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-11-18 08:47:17,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-18 08:47:17,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2018-11-18 08:47:17,482 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 7 [2018-11-18 08:47:17,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:47:17,482 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2018-11-18 08:47:17,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:47:17,482 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2018-11-18 08:47:17,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 08:47:17,483 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:47:17,483 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:47:17,483 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-11-18 08:47:17,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:17,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1300590983, now seen corresponding path program 1 times [2018-11-18 08:47:17,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:47:17,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:47:17,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:17,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:47:17,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:47:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:17,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:17,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:47:17,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 08:47:17,508 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:47:17,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:47:17,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:47:17,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:47:17,509 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand 3 states. [2018-11-18 08:47:17,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:47:17,604 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2018-11-18 08:47:17,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:47:17,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-18 08:47:17,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:47:17,606 INFO L225 Difference]: With dead ends: 135 [2018-11-18 08:47:17,606 INFO L226 Difference]: Without dead ends: 135 [2018-11-18 08:47:17,606 INFO L604 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-11-18 08:47:17,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-18 08:47:17,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2018-11-18 08:47:17,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-18 08:47:17,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-11-18 08:47:17,614 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 10 [2018-11-18 08:47:17,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:47:17,614 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-11-18 08:47:17,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:47:17,614 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-11-18 08:47:17,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 08:47:17,614 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:47:17,615 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:47:17,616 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-11-18 08:47:17,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:17,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1300590982, now seen corresponding path program 1 times [2018-11-18 08:47:17,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:47:17,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:47:17,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:17,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:47:17,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:47:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:17,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:17,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:47:17,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 08:47:17,649 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:47:17,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:47:17,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:47:17,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:47:17,650 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 3 states. [2018-11-18 08:47:17,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:47:17,704 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2018-11-18 08:47:17,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:47:17,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-18 08:47:17,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:47:17,705 INFO L225 Difference]: With dead ends: 124 [2018-11-18 08:47:17,705 INFO L226 Difference]: Without dead ends: 124 [2018-11-18 08:47:17,705 INFO L604 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-11-18 08:47:17,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-18 08:47:17,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-11-18 08:47:17,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-18 08:47:17,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2018-11-18 08:47:17,711 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 10 [2018-11-18 08:47:17,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:47:17,711 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2018-11-18 08:47:17,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:47:17,711 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-11-18 08:47:17,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 08:47:17,712 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:47:17,712 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:47:17,712 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-11-18 08:47:17,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:17,713 INFO L82 PathProgramCache]: Analyzing trace with hash 204096602, now seen corresponding path program 1 times [2018-11-18 08:47:17,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:47:17,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:47:17,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:17,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:47:17,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:47:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:17,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:17,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:47:17,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 08:47:17,749 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:47:17,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:47:17,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:47:17,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:47:17,751 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 3 states. [2018-11-18 08:47:17,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:47:17,809 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2018-11-18 08:47:17,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:47:17,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-18 08:47:17,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:47:17,810 INFO L225 Difference]: With dead ends: 117 [2018-11-18 08:47:17,810 INFO L226 Difference]: Without dead ends: 117 [2018-11-18 08:47:17,810 INFO L604 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-11-18 08:47:17,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-18 08:47:17,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-11-18 08:47:17,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-18 08:47:17,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2018-11-18 08:47:17,817 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 16 [2018-11-18 08:47:17,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:47:17,817 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2018-11-18 08:47:17,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:47:17,818 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2018-11-18 08:47:17,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 08:47:17,818 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:47:17,818 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:47:17,819 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-11-18 08:47:17,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:17,819 INFO L82 PathProgramCache]: Analyzing trace with hash 204096603, now seen corresponding path program 1 times [2018-11-18 08:47:17,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:47:17,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:47:17,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:17,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:47:17,820 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:47:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:17,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:17,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:47:17,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 08:47:17,865 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:47:17,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:47:17,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:47:17,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:47:17,865 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 3 states. [2018-11-18 08:47:17,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:47:17,907 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2018-11-18 08:47:17,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:47:17,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-18 08:47:17,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:47:17,909 INFO L225 Difference]: With dead ends: 112 [2018-11-18 08:47:17,909 INFO L226 Difference]: Without dead ends: 112 [2018-11-18 08:47:17,909 INFO L604 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-11-18 08:47:17,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-18 08:47:17,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-11-18 08:47:17,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-18 08:47:17,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2018-11-18 08:47:17,915 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 16 [2018-11-18 08:47:17,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:47:17,915 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2018-11-18 08:47:17,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:47:17,915 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-11-18 08:47:17,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 08:47:17,916 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:47:17,916 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:47:17,916 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-11-18 08:47:17,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:17,917 INFO L82 PathProgramCache]: Analyzing trace with hash 2032027461, now seen corresponding path program 1 times [2018-11-18 08:47:17,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:47:17,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:47:17,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:17,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:47:17,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:47:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:17,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:47:17,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:47:17,982 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:47:17,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 08:47:17,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 08:47:17,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 08:47:17,983 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 6 states. [2018-11-18 08:47:18,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:47:18,138 INFO L93 Difference]: Finished difference Result 174 states and 187 transitions. [2018-11-18 08:47:18,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 08:47:18,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-18 08:47:18,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:47:18,139 INFO L225 Difference]: With dead ends: 174 [2018-11-18 08:47:18,139 INFO L226 Difference]: Without dead ends: 174 [2018-11-18 08:47:18,140 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 08:47:18,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-18 08:47:18,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 131. [2018-11-18 08:47:18,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-18 08:47:18,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 151 transitions. [2018-11-18 08:47:18,145 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 151 transitions. Word has length 17 [2018-11-18 08:47:18,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:47:18,146 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 151 transitions. [2018-11-18 08:47:18,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 08:47:18,146 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 151 transitions. [2018-11-18 08:47:18,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 08:47:18,146 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:47:18,146 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:47:18,147 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-11-18 08:47:18,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:18,148 INFO L82 PathProgramCache]: Analyzing trace with hash 2032027462, now seen corresponding path program 1 times [2018-11-18 08:47:18,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:47:18,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:47:18,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:18,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:47:18,150 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:47:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:18,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:18,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:47:18,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:47:18,239 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:47:18,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 08:47:18,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 08:47:18,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 08:47:18,240 INFO L87 Difference]: Start difference. First operand 131 states and 151 transitions. Second operand 6 states. [2018-11-18 08:47:18,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:47:18,337 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2018-11-18 08:47:18,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 08:47:18,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-18 08:47:18,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:47:18,339 INFO L225 Difference]: With dead ends: 157 [2018-11-18 08:47:18,339 INFO L226 Difference]: Without dead ends: 157 [2018-11-18 08:47:18,339 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 08:47:18,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-18 08:47:18,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2018-11-18 08:47:18,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-18 08:47:18,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 179 transitions. [2018-11-18 08:47:18,344 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 179 transitions. Word has length 17 [2018-11-18 08:47:18,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:47:18,344 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 179 transitions. [2018-11-18 08:47:18,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 08:47:18,344 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 179 transitions. [2018-11-18 08:47:18,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 08:47:18,345 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:47:18,345 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:47:18,345 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-11-18 08:47:18,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:18,345 INFO L82 PathProgramCache]: Analyzing trace with hash -935781227, now seen corresponding path program 1 times [2018-11-18 08:47:18,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:47:18,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:47:18,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:18,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:47:18,346 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:47:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:18,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:18,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:47:18,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 08:47:18,555 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:47:18,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 08:47:18,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 08:47:18,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-18 08:47:18,556 INFO L87 Difference]: Start difference. First operand 155 states and 179 transitions. Second operand 9 states. [2018-11-18 08:47:18,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:47:18,763 INFO L93 Difference]: Finished difference Result 189 states and 212 transitions. [2018-11-18 08:47:18,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 08:47:18,763 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-11-18 08:47:18,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:47:18,763 INFO L225 Difference]: With dead ends: 189 [2018-11-18 08:47:18,764 INFO L226 Difference]: Without dead ends: 189 [2018-11-18 08:47:18,764 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-18 08:47:18,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-18 08:47:18,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 155. [2018-11-18 08:47:18,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-18 08:47:18,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 178 transitions. [2018-11-18 08:47:18,767 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 178 transitions. Word has length 26 [2018-11-18 08:47:18,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:47:18,767 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 178 transitions. [2018-11-18 08:47:18,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 08:47:18,768 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 178 transitions. [2018-11-18 08:47:18,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 08:47:18,768 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:47:18,768 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:47:18,769 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-11-18 08:47:18,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:18,769 INFO L82 PathProgramCache]: Analyzing trace with hash 723673912, now seen corresponding path program 1 times [2018-11-18 08:47:18,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:47:18,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:47:18,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:18,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:47:18,770 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:47:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:18,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:18,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:47:18,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 08:47:18,961 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:47:18,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 08:47:18,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 08:47:18,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-18 08:47:18,962 INFO L87 Difference]: Start difference. First operand 155 states and 178 transitions. Second operand 9 states. [2018-11-18 08:47:19,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:47:19,148 INFO L93 Difference]: Finished difference Result 147 states and 167 transitions. [2018-11-18 08:47:19,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 08:47:19,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-18 08:47:19,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:47:19,149 INFO L225 Difference]: With dead ends: 147 [2018-11-18 08:47:19,149 INFO L226 Difference]: Without dead ends: 147 [2018-11-18 08:47:19,149 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-18 08:47:19,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-18 08:47:19,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-11-18 08:47:19,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-18 08:47:19,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 167 transitions. [2018-11-18 08:47:19,152 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 167 transitions. Word has length 28 [2018-11-18 08:47:19,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:47:19,153 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 167 transitions. [2018-11-18 08:47:19,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 08:47:19,153 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 167 transitions. [2018-11-18 08:47:19,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 08:47:19,154 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:47:19,154 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:47:19,154 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-11-18 08:47:19,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:19,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1167161761, now seen corresponding path program 1 times [2018-11-18 08:47:19,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:47:19,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:47:19,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:19,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:47:19,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:47:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:19,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:19,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:47:19,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:47:19,196 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 08:47:19,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:47:19,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:47:19,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:47:19,197 INFO L87 Difference]: Start difference. First operand 147 states and 167 transitions. Second operand 3 states. [2018-11-18 08:47:19,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:47:19,208 INFO L93 Difference]: Finished difference Result 154 states and 171 transitions. [2018-11-18 08:47:19,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:47:19,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 08:47:19,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:47:19,210 INFO L225 Difference]: With dead ends: 154 [2018-11-18 08:47:19,210 INFO L226 Difference]: Without dead ends: 154 [2018-11-18 08:47:19,210 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:47:19,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-18 08:47:19,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 143. [2018-11-18 08:47:19,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-18 08:47:19,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 159 transitions. [2018-11-18 08:47:19,216 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 159 transitions. Word has length 34 [2018-11-18 08:47:19,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:47:19,216 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 159 transitions. [2018-11-18 08:47:19,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:47:19,216 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 159 transitions. [2018-11-18 08:47:19,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 08:47:19,217 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:47:19,217 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:47:19,217 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-11-18 08:47:19,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:19,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1872730989, now seen corresponding path program 1 times [2018-11-18 08:47:19,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:47:19,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:47:19,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:19,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:47:19,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:47:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:19,401 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:19,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:47:19,401 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 08:47:19,402 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-11-18 08:47:19,404 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [13], [16], [19], [23], [26], [31], [121], [122], [125], [127], [128], [131], [132], [135], [141], [142], [145], [148], [151], [175], [176], [177], [178], [180], [181] [2018-11-18 08:47:19,425 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 08:47:19,425 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 08:47:19,550 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 08:47:19,551 INFO L272 AbstractInterpreter]: Visited 31 different actions 31 times. Never merged. Never widened. Performed 262 root evaluator evaluations with a maximum evaluation depth of 3. Performed 262 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 29 variables. [2018-11-18 08:47:19,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:19,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 08:47:19,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:47:19,561 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/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-11-18 08:47:19,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:19,569 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 08:47:19,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:19,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:47:19,729 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:19,731 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:19,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 08:47:19,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:19,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-18 08:47:19,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:19,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:47:19,749 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-11-18 08:47:19,782 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:19,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 08:47:19,939 INFO L477 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 25 treesize of output 21 [2018-11-18 08:47:19,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:19,947 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:47:19,948 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:47:19,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-18 08:47:19,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:19,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:47:19,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:7 [2018-11-18 08:47:19,994 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:47:19,994 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:47:19,995 INFO L477 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 11 treesize of output 13 [2018-11-18 08:47:19,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:20,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:47:20,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-11-18 08:47:20,032 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:47:20,032 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:47:20,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-11-18 08:47:20,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:20,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:20,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2018-11-18 08:47:20,050 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:20,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 08:47:20,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2018-11-18 08:47:20,076 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 08:47:20,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 08:47:20,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 08:47:20,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-11-18 08:47:20,077 INFO L87 Difference]: Start difference. First operand 143 states and 159 transitions. Second operand 17 states. [2018-11-18 08:47:20,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:47:20,491 INFO L93 Difference]: Finished difference Result 179 states and 190 transitions. [2018-11-18 08:47:20,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 08:47:20,492 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2018-11-18 08:47:20,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:47:20,493 INFO L225 Difference]: With dead ends: 179 [2018-11-18 08:47:20,493 INFO L226 Difference]: Without dead ends: 179 [2018-11-18 08:47:20,494 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2018-11-18 08:47:20,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-18 08:47:20,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 142. [2018-11-18 08:47:20,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-18 08:47:20,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2018-11-18 08:47:20,498 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 35 [2018-11-18 08:47:20,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:47:20,500 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2018-11-18 08:47:20,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 08:47:20,500 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2018-11-18 08:47:20,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 08:47:20,501 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:47:20,501 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:47:20,502 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-11-18 08:47:20,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:20,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1133396195, now seen corresponding path program 1 times [2018-11-18 08:47:20,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:47:20,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:47:20,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:20,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:47:20,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:47:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:20,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:20,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:47:20,597 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 08:47:20,597 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-11-18 08:47:20,597 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [13], [16], [19], [23], [26], [29], [35], [39], [44], [121], [122], [125], [126], [128], [131], [132], [135], [141], [142], [145], [148], [151], [175], [176], [177], [178], [180], [181], [182] [2018-11-18 08:47:20,600 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 08:47:20,600 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 08:47:20,680 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 08:47:20,680 INFO L272 AbstractInterpreter]: Visited 35 different actions 49 times. Never merged. Never widened. Performed 416 root evaluator evaluations with a maximum evaluation depth of 3. Performed 416 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 30 variables. [2018-11-18 08:47:20,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:20,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 08:47:20,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:47:20,691 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/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-11-18 08:47:20,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:20,709 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 08:47:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:20,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:47:20,768 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:20,769 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:20,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-18 08:47:20,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:20,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:47:20,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-11-18 08:47:20,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-18 08:47:20,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:20,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:47:20,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:20 [2018-11-18 08:47:20,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:20,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 08:47:20,963 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:20,964 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 2 variables, input treesize:21, output treesize:1 [2018-11-18 08:47:20,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:20,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 08:47:20,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 16 [2018-11-18 08:47:20,985 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 08:47:20,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 08:47:20,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 08:47:20,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-11-18 08:47:20,986 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand 13 states. [2018-11-18 08:47:21,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:47:21,313 INFO L93 Difference]: Finished difference Result 178 states and 186 transitions. [2018-11-18 08:47:21,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 08:47:21,313 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-11-18 08:47:21,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:47:21,314 INFO L225 Difference]: With dead ends: 178 [2018-11-18 08:47:21,314 INFO L226 Difference]: Without dead ends: 178 [2018-11-18 08:47:21,315 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-11-18 08:47:21,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-18 08:47:21,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 144. [2018-11-18 08:47:21,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-18 08:47:21,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2018-11-18 08:47:21,318 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 37 [2018-11-18 08:47:21,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:47:21,319 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2018-11-18 08:47:21,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 08:47:21,319 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2018-11-18 08:47:21,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 08:47:21,320 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:47:21,320 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:47:21,320 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-11-18 08:47:21,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:21,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1133396194, now seen corresponding path program 1 times [2018-11-18 08:47:21,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:47:21,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:47:21,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:21,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:47:21,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:47:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:21,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:21,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:47:21,444 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 08:47:21,445 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-11-18 08:47:21,445 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [13], [16], [19], [23], [26], [29], [35], [39], [44], [121], [122], [125], [127], [128], [131], [132], [135], [141], [142], [145], [148], [151], [175], [176], [177], [178], [180], [181], [182] [2018-11-18 08:47:21,446 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 08:47:21,446 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 08:47:21,501 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 08:47:21,501 INFO L272 AbstractInterpreter]: Visited 35 different actions 49 times. Never merged. Never widened. Performed 420 root evaluator evaluations with a maximum evaluation depth of 3. Performed 420 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 30 variables. [2018-11-18 08:47:21,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:21,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 08:47:21,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:47:21,507 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/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-11-18 08:47:21,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:21,522 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 08:47:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:21,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:47:21,595 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:21,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-18 08:47:21,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:21,612 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:21,613 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:21,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-18 08:47:21,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:21,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:47:21,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:30 [2018-11-18 08:47:21,661 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:21,662 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:21,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 30 [2018-11-18 08:47:21,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:21,680 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:21,680 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:21,681 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:21,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 08:47:21,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:21,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 08:47:21,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:33 [2018-11-18 08:47:21,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:21,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 08:47:21,889 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 40 [2018-11-18 08:47:22,280 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:22,280 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 4 variables, input treesize:42, output treesize:1 [2018-11-18 08:47:22,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:22,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 08:47:22,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2018-11-18 08:47:22,305 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 08:47:22,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 08:47:22,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 08:47:22,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2018-11-18 08:47:22,306 INFO L87 Difference]: Start difference. First operand 144 states and 155 transitions. Second operand 14 states. [2018-11-18 08:47:23,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:47:23,158 INFO L93 Difference]: Finished difference Result 168 states and 176 transitions. [2018-11-18 08:47:23,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 08:47:23,159 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-11-18 08:47:23,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:47:23,160 INFO L225 Difference]: With dead ends: 168 [2018-11-18 08:47:23,160 INFO L226 Difference]: Without dead ends: 168 [2018-11-18 08:47:23,160 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2018-11-18 08:47:23,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-18 08:47:23,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 135. [2018-11-18 08:47:23,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-18 08:47:23,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2018-11-18 08:47:23,164 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 37 [2018-11-18 08:47:23,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:47:23,164 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions. [2018-11-18 08:47:23,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 08:47:23,164 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2018-11-18 08:47:23,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 08:47:23,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:47:23,165 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:47:23,165 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-11-18 08:47:23,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:23,166 INFO L82 PathProgramCache]: Analyzing trace with hash -484015026, now seen corresponding path program 1 times [2018-11-18 08:47:23,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 08:47:23,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:47:23,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:23,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:47:23,171 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 08:47:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:23,503 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:23,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:47:23,503 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 08:47:23,503 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-11-18 08:47:23,504 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [13], [16], [19], [23], [26], [31], [121], [122], [125], [128], [131], [132], [135], [137], [141], [142], [145], [148], [151], [154], [155], [158], [161], [162], [165], [169], [175], [176], [177], [178], [180], [181] [2018-11-18 08:47:23,505 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 08:47:23,505 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 08:47:23,544 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 08:47:23,545 INFO L272 AbstractInterpreter]: Visited 38 different actions 40 times. Merged at 1 different actions 1 times. Never widened. Performed 310 root evaluator evaluations with a maximum evaluation depth of 3. Performed 310 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 33 variables. [2018-11-18 08:47:23,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:23,551 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 08:47:23,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:47:23,551 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/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-11-18 08:47:23,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:23,561 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 08:47:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:23,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:47:23,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 08:47:23,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:23,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:23,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-11-18 08:47:23,710 INFO L477 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 13 treesize of output 10 [2018-11-18 08:47:23,712 INFO L477 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 10 treesize of output 9 [2018-11-18 08:47:23,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:23,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:23,724 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-11-18 08:47:23,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-11-18 08:47:23,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-11-18 08:47:23,871 INFO L477 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 24 treesize of output 23 [2018-11-18 08:47:23,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:23,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2018-11-18 08:47:23,923 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 08:47:23,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:47:23,944 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 2 xjuncts. [2018-11-18 08:47:23,944 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:44, output treesize:77 [2018-11-18 08:47:24,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 71 [2018-11-18 08:47:24,010 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:24,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 82 [2018-11-18 08:47:24,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:24,045 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:24,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 60 [2018-11-18 08:47:24,058 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 08:47:24,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:47:24,115 INFO L477 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 41 treesize of output 36 [2018-11-18 08:47:24,117 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:24,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-18 08:47:24,118 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:24,124 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:24,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-18 08:47:24,149 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:116, output treesize:141 [2018-11-18 08:47:24,538 WARN L180 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-11-18 08:47:24,546 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 08:47:24,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:24,562 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:24,563 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:24,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-11-18 08:47:24,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:24,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 08:47:24,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:165, output treesize:66 [2018-11-18 08:47:24,658 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:24,663 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:24,664 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:24,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-11-18 08:47:24,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:24,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 08:47:24,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:77, output treesize:85 [2018-11-18 08:47:24,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2018-11-18 08:47:24,728 INFO L477 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 10 treesize of output 9 [2018-11-18 08:47:24,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:24,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:24,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 08:47:24,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:98, output treesize:85 [2018-11-18 08:47:24,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2018-11-18 08:47:24,794 INFO L477 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 10 treesize of output 9 [2018-11-18 08:47:24,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:24,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:24,817 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-11-18 08:47:24,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:98, output treesize:94 [2018-11-18 08:47:24,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 65 [2018-11-18 08:47:24,879 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:47:24,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2018-11-18 08:47:24,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:24,889 INFO L477 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 7 treesize of output 1 [2018-11-18 08:47:24,889 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:24,895 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:24,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-18 08:47:24,895 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:24,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:24,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 08:47:24,907 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:103, output treesize:28 [2018-11-18 08:47:24,945 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:24,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 08:47:27,308 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:47:27,308 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:47:27,310 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:47:27,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 292 [2018-11-18 08:47:27,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:27,339 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 283 treesize of output 174 [2018-11-18 08:47:27,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-18 08:47:27,396 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:27,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 122 [2018-11-18 08:47:27,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 66 [2018-11-18 08:47:27,529 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:47:27,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-11-18 08:47:27,530 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:27,541 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:27,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 59 [2018-11-18 08:47:27,589 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:47:27,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 69 [2018-11-18 08:47:27,599 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-18 08:47:27,644 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:47:27,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2018-11-18 08:47:27,645 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:27,686 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 08:47:27,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 56 treesize of output 52 [2018-11-18 08:47:27,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 20 [2018-11-18 08:47:27,774 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:28,033 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:47:28,034 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_20 term size 38 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-18 08:47:28,037 INFO L168 Benchmark]: Toolchain (without parser) took 11857.56 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 378.0 MB). Free memory was 951.1 MB in the beginning and 1.4 GB in the end (delta: -415.8 MB). Peak memory consumption was 407.1 MB. Max. memory is 11.5 GB. [2018-11-18 08:47:28,037 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:47:28,037 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.8 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -219.8 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2018-11-18 08:47:28,038 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2018-11-18 08:47:28,038 INFO L168 Benchmark]: Boogie Preprocessor took 25.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:47:28,038 INFO L168 Benchmark]: RCFGBuilder took 385.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 39.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. [2018-11-18 08:47:28,040 INFO L168 Benchmark]: TraceAbstraction took 11076.86 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 198.2 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -241.7 MB). Peak memory consumption was 401.4 MB. Max. memory is 11.5 GB. [2018-11-18 08:47:28,042 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 346.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.8 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -219.8 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 385.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 39.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11076.86 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 198.2 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -241.7 MB). Peak memory consumption was 401.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_20 term size 38 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_20 term size 38: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-5842f4b [2018-11-18 08:47:29,520 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:47:29,521 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:47:29,530 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:47:29,530 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:47:29,531 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:47:29,531 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:47:29,533 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:47:29,534 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:47:29,534 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:47:29,535 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:47:29,535 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:47:29,536 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:47:29,536 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:47:29,537 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:47:29,537 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:47:29,538 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:47:29,540 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:47:29,541 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:47:29,542 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:47:29,543 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:47:29,543 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:47:29,545 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:47:29,545 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:47:29,545 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:47:29,546 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:47:29,546 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:47:29,548 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:47:29,548 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:47:29,549 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:47:29,549 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:47:29,550 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:47:29,550 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:47:29,550 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:47:29,550 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:47:29,552 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:47:29,552 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-11-18 08:47:29,562 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:47:29,562 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:47:29,562 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 08:47:29,563 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 08:47:29,563 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 08:47:29,563 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 08:47:29,563 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 08:47:29,563 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 08:47:29,563 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 08:47:29,563 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 08:47:29,564 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 08:47:29,564 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 08:47:29,564 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:47:29,564 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 08:47:29,564 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 08:47:29,564 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 08:47:29,565 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 08:47:29,565 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:47:29,565 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-18 08:47:29,565 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-18 08:47:29,565 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-18 08:47:29,565 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 08:47:29,565 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 08:47:29,565 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 08:47:29,565 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 08:47:29,566 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:47:29,566 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:47:29,566 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 08:47:29,566 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 08:47:29,566 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 08:47:29,566 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 08:47:29,566 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:47:29,566 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 08:47:29,569 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-18 08:47:29,569 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 08:47:29,569 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 08:47:29,569 INFO L133 SettingsManager]: * Logic for external solver=AUFBV 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_d724eca7-8055-4f38-9145-657f11e95167/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 -> 7db66fa755812d372ccac4d56a0ec85104dbcc6e [2018-11-18 08:47:29,602 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:47:29,612 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:47:29,614 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:47:29,616 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:47:29,616 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:47:29,616 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/../../sv-benchmarks/c/memsafety-ext2/length_test03_true-valid-memsafety.i [2018-11-18 08:47:29,661 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/data/9e9972f44/7bf6f5d1f0b44a94a8be65b96af7cb98/FLAGf8ecb688b [2018-11-18 08:47:30,010 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:47:30,010 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/sv-benchmarks/c/memsafety-ext2/length_test03_true-valid-memsafety.i [2018-11-18 08:47:30,016 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/data/9e9972f44/7bf6f5d1f0b44a94a8be65b96af7cb98/FLAGf8ecb688b [2018-11-18 08:47:30,024 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/data/9e9972f44/7bf6f5d1f0b44a94a8be65b96af7cb98 [2018-11-18 08:47:30,026 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:47:30,027 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 08:47:30,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:47:30,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:47:30,031 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:47:30,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:47:30" (1/1) ... [2018-11-18 08:47:30,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1855e78d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:30, skipping insertion in model container [2018-11-18 08:47:30,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:47:30" (1/1) ... [2018-11-18 08:47:30,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:47:30,072 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:47:30,298 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:47:30,308 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:47:30,348 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:47:30,389 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:47:30,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:30 WrapperNode [2018-11-18 08:47:30,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:47:30,390 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 08:47:30,390 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 08:47:30,390 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 08:47:30,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:30" (1/1) ... [2018-11-18 08:47:30,454 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:30" (1/1) ... [2018-11-18 08:47:30,459 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 08:47:30,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:47:30,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:47:30,459 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:47:30,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:30" (1/1) ... [2018-11-18 08:47:30,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:30" (1/1) ... [2018-11-18 08:47:30,467 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:30" (1/1) ... [2018-11-18 08:47:30,467 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:30" (1/1) ... [2018-11-18 08:47:30,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:30" (1/1) ... [2018-11-18 08:47:30,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:30" (1/1) ... [2018-11-18 08:47:30,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:30" (1/1) ... [2018-11-18 08:47:30,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:47:30,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:47:30,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:47:30,487 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:47:30,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/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-11-18 08:47:30,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 08:47:30,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 08:47:30,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 08:47:30,523 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 08:47:30,523 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 08:47:30,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 08:47:30,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 08:47:30,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2018-11-18 08:47:30,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 08:47:30,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:47:30,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:47:30,524 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-11-18 08:47:30,524 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-11-18 08:47:31,008 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:47:31,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:47:31 BoogieIcfgContainer [2018-11-18 08:47:31,009 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:47:31,010 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 08:47:31,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 08:47:31,012 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 08:47:31,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:47:30" (1/3) ... [2018-11-18 08:47:31,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4664c900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:47:31, skipping insertion in model container [2018-11-18 08:47:31,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:47:30" (2/3) ... [2018-11-18 08:47:31,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4664c900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:47:31, skipping insertion in model container [2018-11-18 08:47:31,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:47:31" (3/3) ... [2018-11-18 08:47:31,016 INFO L112 eAbstractionObserver]: Analyzing ICFG length_test03_true-valid-memsafety.i [2018-11-18 08:47:31,023 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 08:47:31,029 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-11-18 08:47:31,040 INFO L257 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2018-11-18 08:47:31,058 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 08:47:31,058 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 08:47:31,058 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-18 08:47:31,059 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 08:47:31,059 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 08:47:31,059 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 08:47:31,059 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 08:47:31,059 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 08:47:31,059 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 08:47:31,069 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2018-11-18 08:47:31,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 08:47:31,074 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:47:31,075 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:47:31,076 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION]=== [2018-11-18 08:47:31,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:31,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1851498446, now seen corresponding path program 1 times [2018-11-18 08:47:31,082 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 08:47:31,082 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 08:47:31,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:31,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:47:31,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 08:47:31,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:31,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:31,163 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 08:47:31,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:31,172 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 08:47:31,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:47:31,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 08:47:31,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:47:31,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:47:31,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:47:31,191 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2018-11-18 08:47:31,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:47:31,442 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2018-11-18 08:47:31,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:47:31,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-18 08:47:31,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:47:31,454 INFO L225 Difference]: With dead ends: 160 [2018-11-18 08:47:31,454 INFO L226 Difference]: Without dead ends: 157 [2018-11-18 08:47:31,456 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-11-18 08:47:31,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-18 08:47:31,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 122. [2018-11-18 08:47:31,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-18 08:47:31,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2018-11-18 08:47:31,493 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 128 transitions. Word has length 7 [2018-11-18 08:47:31,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:47:31,494 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 128 transitions. [2018-11-18 08:47:31,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:47:31,494 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2018-11-18 08:47:31,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 08:47:31,495 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:47:31,495 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:47:31,495 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION]=== [2018-11-18 08:47:31,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:31,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1851498445, now seen corresponding path program 1 times [2018-11-18 08:47:31,496 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 08:47:31,496 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 08:47:31,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:31,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:31,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:47:31,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 08:47:31,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:31,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:31,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 08:47:31,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:31,567 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 08:47:31,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:47:31,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 08:47:31,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:47:31,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:47:31,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:47:31,573 INFO L87 Difference]: Start difference. First operand 122 states and 128 transitions. Second operand 3 states. [2018-11-18 08:47:31,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:47:31,732 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2018-11-18 08:47:31,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:47:31,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-18 08:47:31,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:47:31,734 INFO L225 Difference]: With dead ends: 122 [2018-11-18 08:47:31,734 INFO L226 Difference]: Without dead ends: 122 [2018-11-18 08:47:31,734 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-11-18 08:47:31,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-18 08:47:31,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-11-18 08:47:31,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-18 08:47:31,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 126 transitions. [2018-11-18 08:47:31,742 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 126 transitions. Word has length 7 [2018-11-18 08:47:31,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:47:31,742 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 126 transitions. [2018-11-18 08:47:31,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:47:31,742 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2018-11-18 08:47:31,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 08:47:31,744 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:47:31,744 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:47:31,744 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION]=== [2018-11-18 08:47:31,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:31,745 INFO L82 PathProgramCache]: Analyzing trace with hash -2020210310, now seen corresponding path program 1 times [2018-11-18 08:47:31,745 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 08:47:31,745 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 08:47:31,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:31,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:47:31,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 08:47:31,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:31,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:47:31,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-11-18 08:47:31,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:31,824 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 08:47:31,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:47:31,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:47:31,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:47:31,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:47:31,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:47:31,827 INFO L87 Difference]: Start difference. First operand 120 states and 126 transitions. Second operand 4 states. [2018-11-18 08:47:32,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:47:32,053 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2018-11-18 08:47:32,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:47:32,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-18 08:47:32,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:47:32,054 INFO L225 Difference]: With dead ends: 142 [2018-11-18 08:47:32,054 INFO L226 Difference]: Without dead ends: 142 [2018-11-18 08:47:32,055 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-11-18 08:47:32,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-18 08:47:32,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 123. [2018-11-18 08:47:32,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-18 08:47:32,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-11-18 08:47:32,062 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 10 [2018-11-18 08:47:32,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:47:32,062 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-11-18 08:47:32,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:47:32,062 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-11-18 08:47:32,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 08:47:32,063 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:47:32,063 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:47:32,063 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION]=== [2018-11-18 08:47:32,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:32,064 INFO L82 PathProgramCache]: Analyzing trace with hash -2020210309, now seen corresponding path program 1 times [2018-11-18 08:47:32,064 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 08:47:32,064 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 08:47:32,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:32,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:47:32,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 08:47:32,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:32,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:32,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 08:47:32,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:32,114 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 08:47:32,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:47:32,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 08:47:32,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:47:32,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:47:32,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:47:32,116 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 3 states. [2018-11-18 08:47:32,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:47:32,255 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2018-11-18 08:47:32,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:47:32,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-18 08:47:32,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:47:32,256 INFO L225 Difference]: With dead ends: 123 [2018-11-18 08:47:32,256 INFO L226 Difference]: Without dead ends: 123 [2018-11-18 08:47:32,256 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-11-18 08:47:32,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-18 08:47:32,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-11-18 08:47:32,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-18 08:47:32,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2018-11-18 08:47:32,262 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 10 [2018-11-18 08:47:32,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:47:32,262 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2018-11-18 08:47:32,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:47:32,262 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2018-11-18 08:47:32,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 08:47:32,263 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:47:32,263 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:47:32,263 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION]=== [2018-11-18 08:47:32,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:32,264 INFO L82 PathProgramCache]: Analyzing trace with hash 878950074, now seen corresponding path program 1 times [2018-11-18 08:47:32,264 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 08:47:32,264 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 08:47:32,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:32,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:47:32,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 08:47:32,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:32,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:32,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 08:47:32,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:32,348 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 08:47:32,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:47:32,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 08:47:32,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:47:32,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:47:32,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:47:32,352 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand 3 states. [2018-11-18 08:47:32,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:47:32,461 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2018-11-18 08:47:32,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:47:32,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-18 08:47:32,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:47:32,462 INFO L225 Difference]: With dead ends: 116 [2018-11-18 08:47:32,463 INFO L226 Difference]: Without dead ends: 116 [2018-11-18 08:47:32,463 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-11-18 08:47:32,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-18 08:47:32,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-11-18 08:47:32,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-18 08:47:32,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2018-11-18 08:47:32,468 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 16 [2018-11-18 08:47:32,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:47:32,469 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2018-11-18 08:47:32,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:47:32,469 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2018-11-18 08:47:32,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 08:47:32,469 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:47:32,469 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:47:32,471 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION]=== [2018-11-18 08:47:32,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:32,471 INFO L82 PathProgramCache]: Analyzing trace with hash 878950075, now seen corresponding path program 1 times [2018-11-18 08:47:32,472 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 08:47:32,472 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 08:47:32,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:32,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:47:32,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 08:47:32,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:32,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:32,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 08:47:32,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:32,537 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 08:47:32,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:47:32,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 08:47:32,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:47:32,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:47:32,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:47:32,539 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand 3 states. [2018-11-18 08:47:32,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:47:32,656 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2018-11-18 08:47:32,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:47:32,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-18 08:47:32,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:47:32,657 INFO L225 Difference]: With dead ends: 111 [2018-11-18 08:47:32,657 INFO L226 Difference]: Without dead ends: 111 [2018-11-18 08:47:32,657 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-11-18 08:47:32,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-18 08:47:32,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-11-18 08:47:32,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-18 08:47:32,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2018-11-18 08:47:32,661 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 16 [2018-11-18 08:47:32,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:47:32,662 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2018-11-18 08:47:32,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:47:32,662 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2018-11-18 08:47:32,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 08:47:32,662 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:47:32,663 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:47:32,663 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION]=== [2018-11-18 08:47:32,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:32,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1477648612, now seen corresponding path program 1 times [2018-11-18 08:47:32,664 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 08:47:32,664 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 08:47:32,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:32,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:47:32,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 08:47:32,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:32,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:32,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 08:47:32,739 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:32,740 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:32,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-18 08:47:32,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:32,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:47:32,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-11-18 08:47:32,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 08:47:32,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:32,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 08:47:32,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:20 [2018-11-18 08:47:32,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:32,804 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 08:47:32,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:47:32,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:47:32,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 08:47:32,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 08:47:32,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 08:47:32,806 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand 6 states. [2018-11-18 08:47:33,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:47:33,312 INFO L93 Difference]: Finished difference Result 216 states and 231 transitions. [2018-11-18 08:47:33,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 08:47:33,313 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-18 08:47:33,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:47:33,314 INFO L225 Difference]: With dead ends: 216 [2018-11-18 08:47:33,314 INFO L226 Difference]: Without dead ends: 216 [2018-11-18 08:47:33,315 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-18 08:47:33,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-11-18 08:47:33,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 136. [2018-11-18 08:47:33,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-18 08:47:33,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 156 transitions. [2018-11-18 08:47:33,320 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 156 transitions. Word has length 17 [2018-11-18 08:47:33,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:47:33,320 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 156 transitions. [2018-11-18 08:47:33,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 08:47:33,320 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 156 transitions. [2018-11-18 08:47:33,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 08:47:33,321 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:47:33,321 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:47:33,321 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION]=== [2018-11-18 08:47:33,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:33,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1477648613, now seen corresponding path program 1 times [2018-11-18 08:47:33,321 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 08:47:33,321 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 08:47:33,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:33,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:47:33,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 08:47:33,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:33,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 08:47:33,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:33,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:33,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-18 08:47:33,434 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:33,439 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:33,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 08:47:33,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:33,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-18 08:47:33,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:33,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:47:33,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-11-18 08:47:33,523 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:33,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 19 treesize of output 28 [2018-11-18 08:47:33,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-11-18 08:47:33,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-18 08:47:33,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:52 [2018-11-18 08:47:33,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:33,620 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 08:47:33,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:47:33,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:47:33,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 08:47:33,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 08:47:33,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 08:47:33,624 INFO L87 Difference]: Start difference. First operand 136 states and 156 transitions. Second operand 6 states. [2018-11-18 08:47:34,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:47:34,100 INFO L93 Difference]: Finished difference Result 162 states and 184 transitions. [2018-11-18 08:47:34,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 08:47:34,101 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-18 08:47:34,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:47:34,101 INFO L225 Difference]: With dead ends: 162 [2018-11-18 08:47:34,101 INFO L226 Difference]: Without dead ends: 162 [2018-11-18 08:47:34,102 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 08:47:34,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-18 08:47:34,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-11-18 08:47:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-18 08:47:34,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 184 transitions. [2018-11-18 08:47:34,104 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 184 transitions. Word has length 17 [2018-11-18 08:47:34,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:47:34,104 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 184 transitions. [2018-11-18 08:47:34,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 08:47:34,105 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 184 transitions. [2018-11-18 08:47:34,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 08:47:34,105 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:47:34,105 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:47:34,105 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION]=== [2018-11-18 08:47:34,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:34,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1131832917, now seen corresponding path program 1 times [2018-11-18 08:47:34,105 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 08:47:34,106 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 08:47:34,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:34,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:47:34,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 08:47:34,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:34,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:34,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 08:47:34,205 INFO L477 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 11 treesize of output 8 [2018-11-18 08:47:34,207 INFO L477 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 8 treesize of output 7 [2018-11-18 08:47:34,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:34,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:34,221 INFO L477 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 11 treesize of output 8 [2018-11-18 08:47:34,222 INFO L477 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 8 treesize of output 7 [2018-11-18 08:47:34,223 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:34,224 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:34,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:34,229 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-11-18 08:47:34,247 INFO L477 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 21 treesize of output 16 [2018-11-18 08:47:34,250 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:34,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 08:47:34,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:34,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:34,278 INFO L477 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 21 treesize of output 16 [2018-11-18 08:47:34,281 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:34,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 08:47:34,282 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:34,287 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:34,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:34,295 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-11-18 08:47:34,313 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:34,314 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:34,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 08:47:34,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:34,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:34,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:40 [2018-11-18 08:47:34,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-18 08:47:34,361 INFO L477 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 8 treesize of output 7 [2018-11-18 08:47:34,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:34,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:34,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-18 08:47:34,396 INFO L477 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 8 treesize of output 7 [2018-11-18 08:47:34,396 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:34,403 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:34,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:34,417 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2018-11-18 08:47:34,457 INFO L477 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 37 treesize of output 36 [2018-11-18 08:47:34,462 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:34,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 08:47:34,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:34,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:34,514 INFO L477 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 37 treesize of output 36 [2018-11-18 08:47:34,520 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:34,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 08:47:34,521 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:34,533 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:34,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 08:47:34,555 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:80, output treesize:72 [2018-11-18 08:47:34,684 INFO L477 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 38 treesize of output 32 [2018-11-18 08:47:34,687 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:34,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-18 08:47:34,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:34,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-11-18 08:47:34,699 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:34,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:34,724 INFO L477 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 38 treesize of output 32 [2018-11-18 08:47:34,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-11-18 08:47:34,728 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:34,739 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:34,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-18 08:47:34,740 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:34,742 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:34,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:34,747 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:79, output treesize:7 [2018-11-18 08:47:34,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:34,785 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 08:47:34,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:47:34,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 08:47:34,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 08:47:34,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 08:47:34,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-11-18 08:47:34,787 INFO L87 Difference]: Start difference. First operand 160 states and 184 transitions. Second operand 12 states. [2018-11-18 08:47:39,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:47:39,128 INFO L93 Difference]: Finished difference Result 160 states and 183 transitions. [2018-11-18 08:47:39,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 08:47:39,128 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-18 08:47:39,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:47:39,129 INFO L225 Difference]: With dead ends: 160 [2018-11-18 08:47:39,129 INFO L226 Difference]: Without dead ends: 160 [2018-11-18 08:47:39,129 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-11-18 08:47:39,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-18 08:47:39,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-11-18 08:47:39,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-18 08:47:39,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 183 transitions. [2018-11-18 08:47:39,132 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 183 transitions. Word has length 26 [2018-11-18 08:47:39,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:47:39,132 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 183 transitions. [2018-11-18 08:47:39,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 08:47:39,132 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 183 transitions. [2018-11-18 08:47:39,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 08:47:39,133 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:47:39,133 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:47:39,133 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION]=== [2018-11-18 08:47:39,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:39,133 INFO L82 PathProgramCache]: Analyzing trace with hash -868991784, now seen corresponding path program 1 times [2018-11-18 08:47:39,134 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 08:47:39,134 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 08:47:39,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:39,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:47:39,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 08:47:39,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:39,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:39,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 08:47:39,251 INFO L477 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 13 treesize of output 10 [2018-11-18 08:47:39,253 INFO L477 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 10 treesize of output 9 [2018-11-18 08:47:39,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:39,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:39,269 INFO L477 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 13 treesize of output 10 [2018-11-18 08:47:39,272 INFO L477 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 10 treesize of output 9 [2018-11-18 08:47:39,272 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:39,274 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:39,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:39,283 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-11-18 08:47:39,296 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:39,297 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:39,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 08:47:39,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:39,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:39,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-11-18 08:47:39,332 INFO L477 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 21 treesize of output 22 [2018-11-18 08:47:39,335 INFO L477 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 8 treesize of output 7 [2018-11-18 08:47:39,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:39,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:39,374 INFO L477 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 21 treesize of output 22 [2018-11-18 08:47:39,376 INFO L477 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 8 treesize of output 7 [2018-11-18 08:47:39,377 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:39,382 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:39,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:39,394 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-11-18 08:47:39,431 INFO L477 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 30 treesize of output 29 [2018-11-18 08:47:39,436 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:39,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 08:47:39,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:39,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:39,481 INFO L477 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 30 treesize of output 29 [2018-11-18 08:47:39,485 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:39,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 08:47:39,486 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:39,495 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:39,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 08:47:39,512 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:58 [2018-11-18 08:47:39,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:39,765 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 08:47:39,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:47:39,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 08:47:39,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 08:47:39,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 08:47:39,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 08:47:39,768 INFO L87 Difference]: Start difference. First operand 160 states and 183 transitions. Second operand 11 states. [2018-11-18 08:47:44,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:47:44,758 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2018-11-18 08:47:44,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 08:47:44,759 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-11-18 08:47:44,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:47:44,759 INFO L225 Difference]: With dead ends: 152 [2018-11-18 08:47:44,759 INFO L226 Difference]: Without dead ends: 152 [2018-11-18 08:47:44,760 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-11-18 08:47:44,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-18 08:47:44,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-11-18 08:47:44,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-18 08:47:44,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 172 transitions. [2018-11-18 08:47:44,762 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 172 transitions. Word has length 28 [2018-11-18 08:47:44,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:47:44,764 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 172 transitions. [2018-11-18 08:47:44,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 08:47:44,764 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 172 transitions. [2018-11-18 08:47:44,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 08:47:44,765 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:47:44,765 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:47:44,765 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION]=== [2018-11-18 08:47:44,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:44,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1429689308, now seen corresponding path program 1 times [2018-11-18 08:47:44,765 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 08:47:44,766 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 08:47:44,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:44,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:47:44,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:44,867 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 08:47:44,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:47:44,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:47:44,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:47:44,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:47:44,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:47:44,870 INFO L87 Difference]: Start difference. First operand 152 states and 172 transitions. Second operand 3 states. [2018-11-18 08:47:44,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:47:44,882 INFO L93 Difference]: Finished difference Result 159 states and 176 transitions. [2018-11-18 08:47:44,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:47:44,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-18 08:47:44,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:47:44,883 INFO L225 Difference]: With dead ends: 159 [2018-11-18 08:47:44,883 INFO L226 Difference]: Without dead ends: 159 [2018-11-18 08:47:44,883 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 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-11-18 08:47:44,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-18 08:47:44,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 148. [2018-11-18 08:47:44,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-18 08:47:44,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 164 transitions. [2018-11-18 08:47:44,886 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 164 transitions. Word has length 33 [2018-11-18 08:47:44,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:47:44,887 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 164 transitions. [2018-11-18 08:47:44,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:47:44,887 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 164 transitions. [2018-11-18 08:47:44,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 08:47:44,887 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:47:44,887 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:47:44,888 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION]=== [2018-11-18 08:47:44,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:44,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1422073874, now seen corresponding path program 1 times [2018-11-18 08:47:44,888 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 08:47:44,888 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 08:47:44,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:45,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:47:45,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 08:47:45,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:45,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:47:45,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2018-11-18 08:47:45,218 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:45,219 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:45,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-18 08:47:45,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:45,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-18 08:47:45,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:45,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:47:45,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2018-11-18 08:47:45,278 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:45,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 08:47:45,770 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2018-11-18 08:47:45,773 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:47:45,773 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:47:45,774 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2018-11-18 08:47:45,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:45,777 INFO L477 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 25 treesize of output 19 [2018-11-18 08:47:45,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:45,847 INFO L477 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 18 treesize of output 16 [2018-11-18 08:47:45,848 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:47:45,905 INFO L477 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 27 treesize of output 21 [2018-11-18 08:47:45,906 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:45,911 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:47:45,911 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:47:45,912 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2018-11-18 08:47:45,913 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:45,954 INFO L477 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 20 treesize of output 18 [2018-11-18 08:47:45,954 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:47:45,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 08:47:45,990 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:130, output treesize:23 [2018-11-18 08:47:46,535 INFO L477 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2018-11-18 08:47:46,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-18 08:47:46,540 INFO L477 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 21 treesize of output 17 [2018-11-18 08:47:46,540 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:47:46,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2018-11-18 08:47:46,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:233 [2018-11-18 08:47:47,054 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 53 [2018-11-18 08:47:47,060 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:47,060 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 2 variables, input treesize:26, output treesize:1 [2018-11-18 08:47:47,068 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:47,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:47:47,078 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:47:47,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:47,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:47:47,406 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:47,407 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:47,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-18 08:47:47,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:47,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-18 08:47:47,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:47,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:47:47,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2018-11-18 08:47:47,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:47,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 08:47:47,665 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:47,665 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 8 variables, input treesize:94, output treesize:1 [2018-11-18 08:47:47,940 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-18 08:47:48,200 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2018-11-18 08:47:48,204 INFO L477 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 42 [2018-11-18 08:47:48,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:47:48,338 INFO L477 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 46 treesize of output 44 [2018-11-18 08:47:48,339 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:47:48,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 51 treesize of output 55 [2018-11-18 08:47:48,515 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-18 08:47:48,520 INFO L477 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 50 treesize of output 48 [2018-11-18 08:47:48,520 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:47:48,688 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:47:48,689 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:47:48,690 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 36 [2018-11-18 08:47:48,690 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:48,698 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:47:48,698 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:47:48,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2018-11-18 08:47:48,700 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:48,703 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:47:48,703 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:47:48,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-11-18 08:47:48,705 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:48,846 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:47:48,847 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:47:48,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 33 [2018-11-18 08:47:48,848 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:49,020 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:47:49,021 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:47:49,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2018-11-18 08:47:49,022 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:49,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2018-11-18 08:47:49,162 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:160, output treesize:155 [2018-11-18 08:47:49,537 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 30 [2018-11-18 08:47:49,560 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:47:49,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 08:47:49,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8, 6] total 22 [2018-11-18 08:47:49,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-18 08:47:49,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-18 08:47:49,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2018-11-18 08:47:49,577 INFO L87 Difference]: Start difference. First operand 148 states and 164 transitions. Second operand 23 states. [2018-11-18 08:47:56,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:47:56,958 INFO L93 Difference]: Finished difference Result 173 states and 183 transitions. [2018-11-18 08:47:56,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 08:47:56,959 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 34 [2018-11-18 08:47:56,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:47:56,960 INFO L225 Difference]: With dead ends: 173 [2018-11-18 08:47:56,960 INFO L226 Difference]: Without dead ends: 173 [2018-11-18 08:47:56,960 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 109 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2018-11-18 08:47:56,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-18 08:47:56,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 142. [2018-11-18 08:47:56,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-18 08:47:56,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 152 transitions. [2018-11-18 08:47:56,963 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 152 transitions. Word has length 34 [2018-11-18 08:47:56,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:47:56,964 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 152 transitions. [2018-11-18 08:47:56,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-18 08:47:56,964 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2018-11-18 08:47:56,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 08:47:56,964 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:47:56,964 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:47:56,965 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION]=== [2018-11-18 08:47:56,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:47:56,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1310690527, now seen corresponding path program 1 times [2018-11-18 08:47:56,965 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 08:47:56,965 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 08:47:56,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:57,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:47:57,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 08:47:57,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:57,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:47:57,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-11-18 08:47:58,256 WARN L854 $PredicateComparison]: unable to prove that (exists ((|append_#t~malloc2.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |append_#t~malloc2.base| (_ bv1 1))) (= (select |c_old(#valid)| |append_#t~malloc2.base|) (_ bv0 1)))) is different from true [2018-11-18 08:47:58,265 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:58,266 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:47:58,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-11-18 08:47:58,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:58,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:47:58,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:16 [2018-11-18 08:47:58,299 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:47:58,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2018-11-18 08:47:58,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:58,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 08:47:58,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:20 [2018-11-18 08:47:58,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-18 08:47:58,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 08:47:58,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:47:58,382 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:47:58,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:47:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:47:58,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:47:58,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 08:47:58,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:47:58,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:47:58,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 08:48:06,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 08:48:06,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:48:06,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:48:06,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2018-11-18 08:48:06,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-18 08:48:06,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:48:06,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:48:06,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:11 [2018-11-18 08:48:07,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:48:07,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 08:48:07,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:48:07,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 08:48:07,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 16 [2018-11-18 08:48:07,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 08:48:07,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 08:48:07,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=233, Unknown=11, NotChecked=32, Total=342 [2018-11-18 08:48:07,614 INFO L87 Difference]: Start difference. First operand 142 states and 152 transitions. Second operand 17 states. [2018-11-18 08:48:19,890 WARN L180 SmtUtils]: Spent 473.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-18 08:48:22,065 WARN L180 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2018-11-18 08:48:24,631 WARN L180 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 18 [2018-11-18 08:48:28,678 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2018-11-18 08:48:33,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:48:33,603 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions. [2018-11-18 08:48:33,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 08:48:33,603 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-11-18 08:48:33,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:48:33,604 INFO L225 Difference]: With dead ends: 208 [2018-11-18 08:48:33,604 INFO L226 Difference]: Without dead ends: 208 [2018-11-18 08:48:33,604 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 91 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=154, Invalid=482, Unknown=18, NotChecked=48, Total=702 [2018-11-18 08:48:33,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-11-18 08:48:33,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 144. [2018-11-18 08:48:33,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-18 08:48:33,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2018-11-18 08:48:33,608 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 36 [2018-11-18 08:48:33,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:48:33,608 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2018-11-18 08:48:33,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 08:48:33,608 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2018-11-18 08:48:33,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 08:48:33,609 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:48:33,609 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:48:33,609 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION]=== [2018-11-18 08:48:33,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:48:33,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1310690526, now seen corresponding path program 1 times [2018-11-18 08:48:33,609 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 08:48:33,610 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 08:48:33,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:48:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:48:33,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:48:33,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 08:48:33,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:48:33,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 08:48:33,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:48:33,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:48:33,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-18 08:48:35,072 WARN L854 $PredicateComparison]: unable to prove that (exists ((|append_#t~malloc2.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |append_#t~malloc2.base| (_ bv9 32))) (= (select |c_old(#valid)| |append_#t~malloc2.base|) (_ bv0 1)))) is different from true [2018-11-18 08:48:35,092 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:48:35,099 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:48:35,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-18 08:48:35,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:48:35,114 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:48:35,114 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:48:35,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 08:48:35,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:48:35,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:48:35,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-11-18 08:48:35,156 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:48:35,161 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:48:35,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 24 [2018-11-18 08:48:35,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-11-18 08:48:35,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-18 08:48:35,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:38 [2018-11-18 08:48:35,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-18 08:48:35,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 08:48:35,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:48:35,618 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:48:35,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:48:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:48:35,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:48:35,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 08:48:35,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:48:35,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 08:48:35,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:48:35,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:48:35,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-18 08:48:35,691 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:48:35,699 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:48:35,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-18 08:48:35,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:48:35,710 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:48:35,711 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:48:35,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-18 08:48:35,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:48:35,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:48:35,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2018-11-18 08:48:35,727 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:48:35,732 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:48:35,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 24 [2018-11-18 08:48:35,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-11-18 08:48:35,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 08:48:35,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:41 [2018-11-18 08:48:35,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-18 08:48:35,856 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 08:48:36,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:48:36,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2018-11-18 08:48:36,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 08:48:36,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 08:48:36,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2018-11-18 08:48:36,159 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand 9 states. [2018-11-18 08:48:39,184 WARN L180 SmtUtils]: Spent 979.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-18 08:48:39,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:48:39,849 INFO L93 Difference]: Finished difference Result 194 states and 213 transitions. [2018-11-18 08:48:39,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 08:48:39,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-11-18 08:48:39,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:48:39,850 INFO L225 Difference]: With dead ends: 194 [2018-11-18 08:48:39,850 INFO L226 Difference]: Without dead ends: 194 [2018-11-18 08:48:39,850 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=48, Invalid=164, Unknown=2, NotChecked=26, Total=240 [2018-11-18 08:48:39,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-18 08:48:39,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 171. [2018-11-18 08:48:39,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-18 08:48:39,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 188 transitions. [2018-11-18 08:48:39,854 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 188 transitions. Word has length 36 [2018-11-18 08:48:39,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:48:39,854 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 188 transitions. [2018-11-18 08:48:39,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 08:48:39,854 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 188 transitions. [2018-11-18 08:48:39,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 08:48:39,855 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:48:39,855 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:48:39,855 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION]=== [2018-11-18 08:48:39,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:48:39,856 INFO L82 PathProgramCache]: Analyzing trace with hash 876489160, now seen corresponding path program 1 times [2018-11-18 08:48:39,856 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 08:48:39,856 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 08:48:39,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:48:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:48:40,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:48:40,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 08:48:40,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:48:40,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:48:40,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 08:48:40,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 08:48:40,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:48:40,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:48:40,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-11-18 08:48:40,088 INFO L477 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 13 treesize of output 10 [2018-11-18 08:48:40,090 INFO L477 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 10 treesize of output 9 [2018-11-18 08:48:40,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:48:40,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:48:40,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:48:40,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-11-18 08:48:40,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-11-18 08:48:46,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 48 [2018-11-18 08:48:46,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-18 08:48:47,832 INFO L477 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 20 treesize of output 19 [2018-11-18 08:48:47,832 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:48:47,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:48:47,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:48:47,900 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:41, output treesize:76 [2018-11-18 08:48:48,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 68 [2018-11-18 08:48:48,079 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:48:48,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 79 [2018-11-18 08:48:48,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:48:48,163 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:48:49,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 55 [2018-11-18 08:48:49,536 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 08:48:49,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:48:49,809 INFO L477 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 34 treesize of output 29 [2018-11-18 08:48:49,813 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:48:49,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-18 08:48:49,814 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 08:48:49,832 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:48:49,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-18 08:48:49,912 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:106, output treesize:120 [2018-11-18 08:48:50,035 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 08:48:50,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:48:50,070 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:48:50,072 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:48:50,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-11-18 08:48:50,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:48:50,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:48:50,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:144, output treesize:60 [2018-11-18 08:48:50,236 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:48:50,238 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:48:50,240 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:48:50,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 54 [2018-11-18 08:48:50,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:48:50,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:48:50,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:72 [2018-11-18 08:48:50,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 72 [2018-11-18 08:48:50,480 INFO L477 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 16 treesize of output 15 [2018-11-18 08:48:50,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:48:50,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:48:50,553 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-11-18 08:48:50,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:87 [2018-11-18 08:48:50,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 79 [2018-11-18 08:48:50,727 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:48:50,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2018-11-18 08:48:50,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:48:50,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:48:50,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-18 08:48:50,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:100, output treesize:96 [2018-11-18 08:48:50,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 60 [2018-11-18 08:48:50,952 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:48:50,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-11-18 08:48:50,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:48:50,980 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:48:50,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-18 08:48:50,981 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:48:50,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-11-18 08:48:50,990 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:48:50,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:48:51,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 08:48:51,006 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:98, output treesize:31 [2018-11-18 08:48:51,108 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:48:51,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 08:49:08,743 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-18 08:49:08,925 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-18 08:49:09,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 97 [2018-11-18 08:49:09,410 WARN L180 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2018-11-18 08:49:09,452 INFO L477 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-11-18 08:49:09,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:49:09,518 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:49:09,519 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:49:09,521 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 98 [2018-11-18 08:49:09,764 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2018-11-18 08:49:09,854 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:49:09,854 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:49:15,702 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 89 treesize of output 117 [2018-11-18 08:49:32,341 WARN L180 SmtUtils]: Spent 16.63 s on a formula simplification. DAG size of input: 227 DAG size of output: 184 [2018-11-18 08:49:32,364 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:49:32,366 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:49:32,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 82 [2018-11-18 08:49:32,368 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 08:49:41,323 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:49:41,341 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:49:41,342 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:49:41,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 45 [2018-11-18 08:49:41,343 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:00,000 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:50:00,004 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:50:00,005 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:50:00,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 86 [2018-11-18 08:50:00,007 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:08,296 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:50:08,296 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:50:08,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 80 [2018-11-18 08:50:08,298 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:08,853 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, 7 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:50:08,909 INFO L477 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 48 treesize of output 42 [2018-11-18 08:50:08,912 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:50:08,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2018-11-18 08:50:08,913 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:08,924 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:50:08,928 INFO L477 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 46 treesize of output 40 [2018-11-18 08:50:08,931 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:50:08,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2018-11-18 08:50:08,933 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:08,944 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:50:08,969 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:50:08,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:50:09,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:50:09,024 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:172, output treesize:29 [2018-11-18 08:50:11,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:50:11,100 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d724eca7-8055-4f38-9145-657f11e95167/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:50:11,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:50:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:50:11,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:50:11,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 08:50:11,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:11,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:50:11,163 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 08:50:11,166 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:50:11,167 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:50:11,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-18 08:50:11,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:11,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:50:11,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2018-11-18 08:50:11,553 INFO L477 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 13 treesize of output 10 [2018-11-18 08:50:11,556 INFO L477 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 10 treesize of output 9 [2018-11-18 08:50:11,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:11,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:50:11,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:50:11,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-11-18 08:50:11,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-11-18 08:50:11,707 INFO L477 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 24 treesize of output 23 [2018-11-18 08:50:11,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:15,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2018-11-18 08:50:15,570 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 08:50:15,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:50:15,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:50:15,664 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:50, output treesize:94 [2018-11-18 08:50:15,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 77 [2018-11-18 08:50:15,957 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:50:15,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 88 [2018-11-18 08:50:15,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:16,036 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:50:17,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 55 treesize of output 61 [2018-11-18 08:50:17,690 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 08:50:17,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:50:17,861 INFO L477 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 43 treesize of output 38 [2018-11-18 08:50:17,864 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:50:17,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-18 08:50:17,865 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:17,880 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:50:17,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-18 08:50:17,944 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:124, output treesize:145 [2018-11-18 08:50:18,143 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 08:50:18,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:18,204 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:50:18,206 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:50:18,207 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:50:18,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-11-18 08:50:18,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:18,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:50:18,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:204, output treesize:64 [2018-11-18 08:50:18,310 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:50:18,311 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:50:18,313 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:50:18,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 54 [2018-11-18 08:50:18,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:18,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:50:18,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:72 [2018-11-18 08:50:18,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 66 [2018-11-18 08:50:18,479 INFO L477 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 10 treesize of output 9 [2018-11-18 08:50:18,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:18,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:50:18,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:50:18,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:72 [2018-11-18 08:50:18,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 66 [2018-11-18 08:50:18,635 INFO L477 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 10 treesize of output 9 [2018-11-18 08:50:18,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:18,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:50:18,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-18 08:50:18,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:81 [2018-11-18 08:50:18,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 51 [2018-11-18 08:50:18,881 INFO L477 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 7 treesize of output 1 [2018-11-18 08:50:18,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:18,908 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:50:18,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-18 08:50:18,909 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:18,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-11-18 08:50:18,918 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:18,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:50:18,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 08:50:18,930 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:85, output treesize:31 [2018-11-18 08:50:18,937 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:50:18,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 08:50:22,841 WARN L180 SmtUtils]: Spent 716.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-18 08:50:23,970 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-18 08:50:24,151 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-18 08:50:24,503 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-11-18 08:50:24,514 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:50:24,519 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:50:24,519 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:50:24,523 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:50:24,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 196 [2018-11-18 08:50:24,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:24,594 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 120 [2018-11-18 08:50:24,843 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-11-18 08:50:24,849 INFO L477 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-11-18 08:50:24,849 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:24,895 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:50:24,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 93 [2018-11-18 08:50:24,990 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:50:28,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 40 [2018-11-18 08:50:28,337 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:50:28,361 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:50:28,361 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:50:28,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 55 [2018-11-18 08:50:28,362 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:31,455 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:50:31,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 36 [2018-11-18 08:50:31,456 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:33,499 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:50:35,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 47 treesize of output 39 [2018-11-18 08:50:35,629 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:50:35,629 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:50:35,631 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:50:35,631 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-11-18 08:50:35,632 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:35,647 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:50:35,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 50 treesize of output 42 [2018-11-18 08:50:35,655 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:50:35,656 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:50:35,656 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-11-18 08:50:35,657 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:35,667 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:50:35,690 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:50:35,713 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:50:35,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:50:35,751 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 7 variables, input treesize:138, output treesize:20 [2018-11-18 08:50:44,015 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-11-18 08:50:50,583 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2018-11-18 08:50:50,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 91 [2018-11-18 08:50:50,987 WARN L180 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2018-11-18 08:50:50,996 INFO L477 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-11-18 08:50:50,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:51,517 INFO L303 Elim1Store]: Index analysis took 197 ms [2018-11-18 08:50:51,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 111 treesize of output 129 [2018-11-18 08:50:55,498 WARN L180 SmtUtils]: Spent 3.79 s on a formula simplification. DAG size of input: 309 DAG size of output: 302 [2018-11-18 08:50:55,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 97 [2018-11-18 08:50:55,808 WARN L180 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2018-11-18 08:50:55,815 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:50:55,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2018-11-18 08:50:55,816 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:55,922 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2018-11-18 08:50:55,922 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 08:50:55,998 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 08:50:56,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-11-18 08:50:56,007 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:50:56,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-11-18 08:50:56,008 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:56,039 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:50:56,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 107 [2018-11-18 08:50:56,234 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2018-11-18 08:50:56,241 INFO L477 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 15 treesize of output 6 [2018-11-18 08:50:56,241 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:56,265 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2018-11-18 08:50:56,265 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 08:50:56,370 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:50:56,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2018-11-18 08:50:56,372 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:56,452 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-18 08:50:59,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2018-11-18 08:50:59,676 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:50:59,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-11-18 08:50:59,677 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:59,717 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:50:59,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 91 [2018-11-18 08:50:59,731 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:50:59,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2018-11-18 08:50:59,732 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-18 08:50:59,796 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:51:02,106 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:51:02,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 65 [2018-11-18 08:51:03,176 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:51:03,182 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:51:03,182 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:51:03,183 INFO L303 Elim1Store]: Index analysis took 894 ms [2018-11-18 08:51:09,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 109 [2018-11-18 08:51:09,233 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 3 xjuncts. [2018-11-18 08:51:15,878 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:51:15,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 61 [2018-11-18 08:51:15,879 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-18 08:51:22,013 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 08:51:22,023 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:51:22,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 71 [2018-11-18 08:51:22,046 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:51:22,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 62 [2018-11-18 08:51:22,047 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-18 08:51:22,087 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:51:28,646 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:51:28,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 104 [2018-11-18 08:51:29,048 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:51:29,053 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:51:29,053 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:51:29,054 INFO L303 Elim1Store]: Index analysis took 116 ms [2018-11-18 08:51:30,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 127 [2018-11-18 08:51:30,538 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-11-18 08:51:31,189 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:51:31,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 97 [2018-11-18 08:51:31,191 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-18 08:51:31,379 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 08:51:32,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 61 [2018-11-18 08:51:32,806 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:51:34,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 71 [2018-11-18 08:51:34,060 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-11-18 08:51:34,193 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:51:34,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2018-11-18 08:51:34,195 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-18 08:51:34,313 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 08:51:37,010 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:51:37,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 76 [2018-11-18 08:51:37,170 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:51:37,178 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:51:39,095 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:51:39,096 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_prenex_95 term size 44 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-18 08:51:39,098 INFO L168 Benchmark]: Toolchain (without parser) took 249071.71 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 245.4 MB). Free memory was 945.4 MB in the beginning and 812.8 MB in the end (delta: 132.7 MB). Peak memory consumption was 416.4 MB. Max. memory is 11.5 GB. [2018-11-18 08:51:39,099 INFO L168 Benchmark]: CDTParser took 0.17 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-11-18 08:51:39,099 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.68 ms. Allocated memory is still 1.0 GB. Free memory was 945.4 MB in the beginning and 924.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-18 08:51:39,099 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 924.0 MB in the beginning and 1.1 GB in the end (delta: -194.0 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. [2018-11-18 08:51:39,099 INFO L168 Benchmark]: Boogie Preprocessor took 26.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:51:39,099 INFO L168 Benchmark]: RCFGBuilder took 522.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. [2018-11-18 08:51:39,099 INFO L168 Benchmark]: TraceAbstraction took 248088.19 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 114.3 MB). Free memory was 1.1 GB in the beginning and 812.8 MB in the end (delta: 259.5 MB). Peak memory consumption was 412.2 MB. Max. memory is 11.5 GB. [2018-11-18 08:51:39,100 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.17 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 361.68 ms. Allocated memory is still 1.0 GB. Free memory was 945.4 MB in the beginning and 924.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 924.0 MB in the beginning and 1.1 GB in the end (delta: -194.0 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 522.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 248088.19 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 114.3 MB). Free memory was 1.1 GB in the beginning and 812.8 MB in the end (delta: 259.5 MB). Peak memory consumption was 412.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_prenex_95 term size 44 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_prenex_95 term size 44: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...