./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/list-properties/splice_true-unreach-call_false-valid-memtrack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-properties/splice_true-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a6926cb8b218b88766a46625572033d3072b3110 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_ad44a58d-3f8c-41fd-bef7-0edaffce4526/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-properties/splice_true-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a6926cb8b218b88766a46625572033d3072b3110 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_126 term size 42 --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 17:43:39,413 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 17:43:39,414 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 17:43:39,421 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 17:43:39,421 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 17:43:39,422 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 17:43:39,423 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 17:43:39,424 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 17:43:39,425 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 17:43:39,425 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 17:43:39,426 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 17:43:39,426 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 17:43:39,427 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 17:43:39,427 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 17:43:39,428 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 17:43:39,429 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 17:43:39,429 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 17:43:39,430 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 17:43:39,432 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 17:43:39,433 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 17:43:39,433 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 17:43:39,434 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 17:43:39,436 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 17:43:39,436 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 17:43:39,436 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 17:43:39,437 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 17:43:39,437 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 17:43:39,438 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 17:43:39,438 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 17:43:39,439 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 17:43:39,439 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 17:43:39,440 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 17:43:39,440 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 17:43:39,440 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 17:43:39,441 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 17:43:39,441 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 17:43:39,441 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 17:43:39,448 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 17:43:39,448 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 17:43:39,449 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 17:43:39,449 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 17:43:39,449 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 17:43:39,449 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 17:43:39,449 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 17:43:39,449 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 17:43:39,449 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 17:43:39,450 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 17:43:39,450 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 17:43:39,450 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 17:43:39,450 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 17:43:39,450 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 17:43:39,451 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 17:43:39,451 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 17:43:39,451 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 17:43:39,451 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 17:43:39,451 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 17:43:39,451 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 17:43:39,451 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 17:43:39,451 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 17:43:39,452 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 17:43:39,452 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 17:43:39,452 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 17:43:39,452 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 17:43:39,452 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 17:43:39,452 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 17:43:39,452 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 17:43:39,453 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 17:43:39,453 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 17:43:39,453 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 17:43:39,453 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 17:43:39,453 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 17:43:39,453 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 17:43:39,453 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 17:43:39,453 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 17:43:39,454 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_ad44a58d-3f8c-41fd-bef7-0edaffce4526/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 ! call(__VERIFIER_error())) ) 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 -> a6926cb8b218b88766a46625572033d3072b3110 [2018-11-18 17:43:39,476 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 17:43:39,484 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 17:43:39,487 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 17:43:39,488 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 17:43:39,488 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 17:43:39,489 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/bin-2019/utaipan/../../sv-benchmarks/c/list-properties/splice_true-unreach-call_false-valid-memtrack.i [2018-11-18 17:43:39,534 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/bin-2019/utaipan/data/53c9f2916/f49ae8f84fed4a3abe3c41b15c38d144/FLAG320cf4022 [2018-11-18 17:43:39,900 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 17:43:39,901 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/sv-benchmarks/c/list-properties/splice_true-unreach-call_false-valid-memtrack.i [2018-11-18 17:43:39,909 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/bin-2019/utaipan/data/53c9f2916/f49ae8f84fed4a3abe3c41b15c38d144/FLAG320cf4022 [2018-11-18 17:43:40,290 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/bin-2019/utaipan/data/53c9f2916/f49ae8f84fed4a3abe3c41b15c38d144 [2018-11-18 17:43:40,292 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 17:43:40,293 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 17:43:40,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 17:43:40,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 17:43:40,295 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 17:43:40,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:43:40" (1/1) ... [2018-11-18 17:43:40,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@316a6cf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:43:40, skipping insertion in model container [2018-11-18 17:43:40,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:43:40" (1/1) ... [2018-11-18 17:43:40,303 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 17:43:40,329 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 17:43:40,511 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:43:40,518 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 17:43:40,548 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:43:40,616 INFO L195 MainTranslator]: Completed translation [2018-11-18 17:43:40,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:43:40 WrapperNode [2018-11-18 17:43:40,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 17:43:40,616 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 17:43:40,616 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 17:43:40,617 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 17:43:40,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:43:40" (1/1) ... [2018-11-18 17:43:40,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:43:40" (1/1) ... [2018-11-18 17:43:40,636 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 17:43:40,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 17:43:40,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 17:43:40,637 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 17:43:40,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:43:40" (1/1) ... [2018-11-18 17:43:40,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:43:40" (1/1) ... [2018-11-18 17:43:40,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:43:40" (1/1) ... [2018-11-18 17:43:40,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:43:40" (1/1) ... [2018-11-18 17:43:40,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:43:40" (1/1) ... [2018-11-18 17:43:40,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:43:40" (1/1) ... [2018-11-18 17:43:40,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:43:40" (1/1) ... [2018-11-18 17:43:40,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 17:43:40,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 17:43:40,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 17:43:40,656 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 17:43:40,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:43:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/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 17:43:40,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 17:43:40,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 17:43:40,688 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 17:43:40,688 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-18 17:43:40,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 17:43:40,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 17:43:40,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 17:43:40,688 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 17:43:40,688 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 17:43:40,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 17:43:40,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 17:43:40,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 17:43:40,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 17:43:40,876 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 17:43:40,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:43:40 BoogieIcfgContainer [2018-11-18 17:43:40,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 17:43:40,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 17:43:40,877 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 17:43:40,879 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 17:43:40,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:43:40" (1/3) ... [2018-11-18 17:43:40,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf12aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:43:40, skipping insertion in model container [2018-11-18 17:43:40,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:43:40" (2/3) ... [2018-11-18 17:43:40,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf12aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:43:40, skipping insertion in model container [2018-11-18 17:43:40,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:43:40" (3/3) ... [2018-11-18 17:43:40,881 INFO L112 eAbstractionObserver]: Analyzing ICFG splice_true-unreach-call_false-valid-memtrack.i [2018-11-18 17:43:40,887 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 17:43:40,892 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 17:43:40,900 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 17:43:40,921 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 17:43:40,921 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 17:43:40,922 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 17:43:40,922 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 17:43:40,922 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 17:43:40,922 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 17:43:40,922 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 17:43:40,922 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 17:43:40,933 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-11-18 17:43:40,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 17:43:40,937 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:43:40,938 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 17:43:40,940 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:43:40,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:43:40,944 INFO L82 PathProgramCache]: Analyzing trace with hash -518534277, now seen corresponding path program 1 times [2018-11-18 17:43:40,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:43:40,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:43:40,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:43:40,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:43:40,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:43:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:43:41,018 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 17:43:41,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:43:41,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 17:43:41,020 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:43:41,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 17:43:41,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 17:43:41,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 17:43:41,031 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-11-18 17:43:41,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:43:41,044 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2018-11-18 17:43:41,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 17:43:41,045 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-18 17:43:41,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:43:41,049 INFO L225 Difference]: With dead ends: 61 [2018-11-18 17:43:41,049 INFO L226 Difference]: Without dead ends: 31 [2018-11-18 17:43:41,052 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 17:43:41,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-18 17:43:41,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-18 17:43:41,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 17:43:41,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2018-11-18 17:43:41,076 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 17 [2018-11-18 17:43:41,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:43:41,076 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2018-11-18 17:43:41,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 17:43:41,076 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2018-11-18 17:43:41,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 17:43:41,077 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:43:41,077 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] [2018-11-18 17:43:41,077 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:43:41,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:43:41,078 INFO L82 PathProgramCache]: Analyzing trace with hash 417617458, now seen corresponding path program 1 times [2018-11-18 17:43:41,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:43:41,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:43:41,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:43:41,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:43:41,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:43:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:43:41,163 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 17:43:41,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:43:41,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 17:43:41,163 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:43:41,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 17:43:41,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 17:43:41,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 17:43:41,165 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 4 states. [2018-11-18 17:43:41,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:43:41,240 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2018-11-18 17:43:41,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:43:41,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-18 17:43:41,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:43:41,241 INFO L225 Difference]: With dead ends: 53 [2018-11-18 17:43:41,241 INFO L226 Difference]: Without dead ends: 44 [2018-11-18 17:43:41,241 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:43:41,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-18 17:43:41,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2018-11-18 17:43:41,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 17:43:41,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-11-18 17:43:41,246 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 21 [2018-11-18 17:43:41,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:43:41,247 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-18 17:43:41,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 17:43:41,247 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-18 17:43:41,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 17:43:41,247 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:43:41,247 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] [2018-11-18 17:43:41,247 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:43:41,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:43:41,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1330658670, now seen corresponding path program 1 times [2018-11-18 17:43:41,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:43:41,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:43:41,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:43:41,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:43:41,248 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:43:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:43:41,292 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 17:43:41,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:43:41,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 17:43:41,293 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:43:41,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 17:43:41,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 17:43:41,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 17:43:41,293 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 4 states. [2018-11-18 17:43:41,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:43:41,323 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2018-11-18 17:43:41,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:43:41,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-18 17:43:41,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:43:41,325 INFO L225 Difference]: With dead ends: 63 [2018-11-18 17:43:41,326 INFO L226 Difference]: Without dead ends: 52 [2018-11-18 17:43:41,326 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:43:41,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-18 17:43:41,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-11-18 17:43:41,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-18 17:43:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2018-11-18 17:43:41,332 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 24 [2018-11-18 17:43:41,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:43:41,332 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2018-11-18 17:43:41,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 17:43:41,333 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2018-11-18 17:43:41,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 17:43:41,333 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:43:41,333 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] [2018-11-18 17:43:41,333 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:43:41,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:43:41,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1013031593, now seen corresponding path program 1 times [2018-11-18 17:43:41,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:43:41,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:43:41,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:43:41,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:43:41,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:43:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:43:41,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:43:41,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:43:41,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:43:41,403 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:43:41,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:43:41,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:43:41,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:43:41,404 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand 6 states. [2018-11-18 17:43:41,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:43:41,516 INFO L93 Difference]: Finished difference Result 92 states and 116 transitions. [2018-11-18 17:43:41,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 17:43:41,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-18 17:43:41,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:43:41,517 INFO L225 Difference]: With dead ends: 92 [2018-11-18 17:43:41,517 INFO L226 Difference]: Without dead ends: 57 [2018-11-18 17:43:41,518 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-18 17:43:41,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-18 17:43:41,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-11-18 17:43:41,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-18 17:43:41,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2018-11-18 17:43:41,522 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 25 [2018-11-18 17:43:41,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:43:41,522 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2018-11-18 17:43:41,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:43:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2018-11-18 17:43:41,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 17:43:41,523 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:43:41,523 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] [2018-11-18 17:43:41,523 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:43:41,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:43:41,523 INFO L82 PathProgramCache]: Analyzing trace with hash 2048581833, now seen corresponding path program 1 times [2018-11-18 17:43:41,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:43:41,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:43:41,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:43:41,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:43:41,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:43:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:43:41,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 17:43:41,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:43:41,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:43:41,543 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:43:41,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:43:41,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:43:41,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:43:41,545 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 3 states. [2018-11-18 17:43:41,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:43:41,558 INFO L93 Difference]: Finished difference Result 111 states and 139 transitions. [2018-11-18 17:43:41,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:43:41,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 17:43:41,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:43:41,559 INFO L225 Difference]: With dead ends: 111 [2018-11-18 17:43:41,559 INFO L226 Difference]: Without dead ends: 69 [2018-11-18 17:43:41,559 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 17:43:41,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-18 17:43:41,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 57. [2018-11-18 17:43:41,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-18 17:43:41,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2018-11-18 17:43:41,563 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 32 [2018-11-18 17:43:41,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:43:41,563 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2018-11-18 17:43:41,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:43:41,563 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2018-11-18 17:43:41,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 17:43:41,563 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:43:41,563 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] [2018-11-18 17:43:41,563 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:43:41,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:43:41,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1625880007, now seen corresponding path program 1 times [2018-11-18 17:43:41,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:43:41,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:43:41,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:43:41,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:43:41,564 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:43:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:43:41,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:43:41,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:43:41,722 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:43:41,722 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-11-18 17:43:41,723 INFO L202 CegarAbsIntRunner]: [4], [5], [9], [15], [17], [21], [23], [26], [28], [31], [35], [41], [43], [47], [51], [55], [57], [60], [62], [65], [72], [76], [82], [85], [111], [114], [115], [116] [2018-11-18 17:43:41,746 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:43:41,747 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:43:41,931 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 17:43:41,932 INFO L272 AbstractInterpreter]: Visited 28 different actions 46 times. Merged at 16 different actions 16 times. Never widened. Performed 343 root evaluator evaluations with a maximum evaluation depth of 3. Performed 343 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 41 variables. [2018-11-18 17:43:41,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:43:41,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 17:43:41,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:43:41,941 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/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 17:43:41,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:43:41,954 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 17:43:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:43:41,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:43:42,017 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 17:43:42,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:42,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:42,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 17:43:42,060 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 17:43:42,062 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 17:43:42,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:42,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:42,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:42,068 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-18 17:43:42,086 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:43:42,092 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:43:42,093 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 17:43:42,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:42,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:42,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-11-18 17:43:42,138 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 19 treesize of output 20 [2018-11-18 17:43:42,140 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 17:43:42,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:42,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:42,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 17:43:42,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-18 17:43:42,259 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 22 treesize of output 20 [2018-11-18 17:43:42,261 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 11 treesize of output 3 [2018-11-18 17:43:42,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:42,266 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 5 treesize of output 1 [2018-11-18 17:43:42,266 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:42,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:42,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:42,270 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-18 17:43:42,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:43:42,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:43:42,374 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 17 treesize of output 15 [2018-11-18 17:43:42,375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-18 17:43:42,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:42,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:42,379 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 17 treesize of output 15 [2018-11-18 17:43:42,381 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 5 treesize of output 3 [2018-11-18 17:43:42,381 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:42,383 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:42,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 17:43:42,391 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2018-11-18 17:43:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:43:42,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 17:43:42,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2018-11-18 17:43:42,468 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 17:43:42,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 17:43:42,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 17:43:42,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2018-11-18 17:43:42,469 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 20 states. [2018-11-18 17:43:43,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:43:43,057 INFO L93 Difference]: Finished difference Result 171 states and 206 transitions. [2018-11-18 17:43:43,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-18 17:43:43,057 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 32 [2018-11-18 17:43:43,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:43:43,058 INFO L225 Difference]: With dead ends: 171 [2018-11-18 17:43:43,058 INFO L226 Difference]: Without dead ends: 169 [2018-11-18 17:43:43,059 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=368, Invalid=1702, Unknown=0, NotChecked=0, Total=2070 [2018-11-18 17:43:43,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-18 17:43:43,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 85. [2018-11-18 17:43:43,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-18 17:43:43,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2018-11-18 17:43:43,068 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 32 [2018-11-18 17:43:43,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:43:43,068 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2018-11-18 17:43:43,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 17:43:43,068 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2018-11-18 17:43:43,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 17:43:43,069 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:43:43,069 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] [2018-11-18 17:43:43,069 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:43:43,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:43:43,069 INFO L82 PathProgramCache]: Analyzing trace with hash -2048989846, now seen corresponding path program 1 times [2018-11-18 17:43:43,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:43:43,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:43:43,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:43:43,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:43:43,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:43:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:43:43,241 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:43:43,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:43:43,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:43:43,242 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-11-18 17:43:43,242 INFO L202 CegarAbsIntRunner]: [4], [5], [9], [15], [17], [21], [23], [26], [28], [31], [35], [41], [43], [47], [51], [55], [57], [60], [62], [65], [72], [76], [82], [85], [87], [111], [114], [115], [116] [2018-11-18 17:43:43,244 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:43:43,244 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:43:43,317 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 17:43:43,317 INFO L272 AbstractInterpreter]: Visited 29 different actions 52 times. Merged at 20 different actions 21 times. Never widened. Performed 375 root evaluator evaluations with a maximum evaluation depth of 3. Performed 375 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 43 variables. [2018-11-18 17:43:43,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:43:43,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 17:43:43,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:43:43,326 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/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 17:43:43,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:43:43,333 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 17:43:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:43:43,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:43:43,378 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 28 treesize of output 23 [2018-11-18 17:43:43,388 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 17:43:43,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:43,389 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 17 treesize of output 16 [2018-11-18 17:43:43,389 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:43,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:43,399 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 17:43:43,400 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 17:43:43,400 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:43,402 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:43,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:43,406 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:44, output treesize:22 [2018-11-18 17:43:43,421 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 15 treesize of output 11 [2018-11-18 17:43:43,423 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 11 treesize of output 3 [2018-11-18 17:43:43,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:43,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:43,428 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 15 treesize of output 11 [2018-11-18 17:43:43,430 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 11 treesize of output 3 [2018-11-18 17:43:43,430 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:43,431 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:43,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:43,434 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-18 17:43:43,435 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 17:43:43,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:43:43,476 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 17:43:43,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 17:43:43,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 6] total 15 [2018-11-18 17:43:43,492 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 17:43:43,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 17:43:43,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 17:43:43,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-11-18 17:43:43,493 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand 12 states. [2018-11-18 17:43:43,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:43:43,781 INFO L93 Difference]: Finished difference Result 121 states and 142 transitions. [2018-11-18 17:43:43,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 17:43:43,781 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-11-18 17:43:43,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:43:43,782 INFO L225 Difference]: With dead ends: 121 [2018-11-18 17:43:43,782 INFO L226 Difference]: Without dead ends: 108 [2018-11-18 17:43:43,783 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2018-11-18 17:43:43,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-18 17:43:43,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 88. [2018-11-18 17:43:43,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-18 17:43:43,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2018-11-18 17:43:43,791 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 35 [2018-11-18 17:43:43,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:43:43,792 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2018-11-18 17:43:43,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 17:43:43,792 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2018-11-18 17:43:43,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 17:43:43,793 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:43:43,793 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-11-18 17:43:43,793 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:43:43,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:43:43,793 INFO L82 PathProgramCache]: Analyzing trace with hash 846146156, now seen corresponding path program 2 times [2018-11-18 17:43:43,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:43:43,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:43:43,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:43:43,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:43:43,795 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:43:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:43:43,830 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 17:43:43,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:43:43,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:43:43,830 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:43:43,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:43:43,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:43:43,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:43:43,831 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand 3 states. [2018-11-18 17:43:43,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:43:43,843 INFO L93 Difference]: Finished difference Result 146 states and 174 transitions. [2018-11-18 17:43:43,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:43:43,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-18 17:43:43,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:43:43,844 INFO L225 Difference]: With dead ends: 146 [2018-11-18 17:43:43,844 INFO L226 Difference]: Without dead ends: 93 [2018-11-18 17:43:43,845 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 17:43:43,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-18 17:43:43,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 80. [2018-11-18 17:43:43,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-18 17:43:43,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-11-18 17:43:43,852 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 36 [2018-11-18 17:43:43,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:43:43,852 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-11-18 17:43:43,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:43:43,852 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-11-18 17:43:43,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 17:43:43,854 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:43:43,854 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 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 17:43:43,855 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:43:43,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:43:43,855 INFO L82 PathProgramCache]: Analyzing trace with hash 583145174, now seen corresponding path program 1 times [2018-11-18 17:43:43,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:43:43,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:43:43,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:43:43,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:43:43,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:43:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:43:43,889 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 17:43:43,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:43:43,889 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:43:43,890 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-11-18 17:43:43,890 INFO L202 CegarAbsIntRunner]: [4], [5], [9], [15], [17], [21], [23], [26], [28], [31], [35], [41], [43], [47], [51], [55], [57], [60], [62], [65], [67], [72], [76], [80], [91], [95], [101], [104], [111], [114], [115], [116] [2018-11-18 17:43:43,892 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:43:43,893 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:43:43,986 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 17:43:43,986 INFO L272 AbstractInterpreter]: Visited 32 different actions 77 times. Merged at 23 different actions 39 times. Never widened. Performed 563 root evaluator evaluations with a maximum evaluation depth of 3. Performed 563 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 7 fixpoints after 5 different actions. Largest state had 41 variables. [2018-11-18 17:43:44,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:43:44,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 17:43:44,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:43:44,001 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/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 17:43:44,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:43:44,007 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 17:43:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:43:44,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:43:44,034 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 17:43:44,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:43:44,041 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 17:43:44,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 17:43:44,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 7 [2018-11-18 17:43:44,056 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 17:43:44,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 17:43:44,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 17:43:44,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:43:44,057 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 7 states. [2018-11-18 17:43:44,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:43:44,149 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2018-11-18 17:43:44,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 17:43:44,150 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-11-18 17:43:44,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:43:44,150 INFO L225 Difference]: With dead ends: 108 [2018-11-18 17:43:44,151 INFO L226 Difference]: Without dead ends: 102 [2018-11-18 17:43:44,151 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-11-18 17:43:44,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-18 17:43:44,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 87. [2018-11-18 17:43:44,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-18 17:43:44,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-11-18 17:43:44,159 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 39 [2018-11-18 17:43:44,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:43:44,160 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-11-18 17:43:44,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 17:43:44,160 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-11-18 17:43:44,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 17:43:44,161 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:43:44,162 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-11-18 17:43:44,162 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:43:44,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:43:44,163 INFO L82 PathProgramCache]: Analyzing trace with hash 636124515, now seen corresponding path program 1 times [2018-11-18 17:43:44,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:43:44,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:43:44,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:43:44,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:43:44,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:43:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:43:44,248 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 17:43:44,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:43:44,248 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:43:44,248 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-11-18 17:43:44,248 INFO L202 CegarAbsIntRunner]: [4], [5], [9], [15], [17], [21], [23], [26], [28], [31], [35], [41], [43], [47], [51], [55], [57], [60], [62], [65], [67], [72], [76], [82], [85], [87], [111], [114], [115], [116] [2018-11-18 17:43:44,250 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:43:44,250 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:43:44,335 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 17:43:44,335 INFO L272 AbstractInterpreter]: Visited 30 different actions 83 times. Merged at 21 different actions 46 times. Widened at 1 different actions 1 times. Performed 594 root evaluator evaluations with a maximum evaluation depth of 3. Performed 594 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 9 fixpoints after 5 different actions. Largest state had 43 variables. [2018-11-18 17:43:44,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:43:44,342 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 17:43:44,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:43:44,342 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/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 17:43:44,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:43:44,352 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 17:43:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:43:44,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:43:44,441 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 17:43:44,444 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 17:43:44,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:44,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:44,462 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 17:43:44,464 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 17:43:44,464 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:44,466 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:44,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:44,472 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:19 [2018-11-18 17:43:44,487 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 29 treesize of output 20 [2018-11-18 17:43:44,489 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 17:43:44,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:44,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:44,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:44,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:19 [2018-11-18 17:43:44,518 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 29 treesize of output 25 [2018-11-18 17:43:44,521 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 25 treesize of output 13 [2018-11-18 17:43:44,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:44,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:44,530 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 23 treesize of output 19 [2018-11-18 17:43:44,533 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 19 treesize of output 7 [2018-11-18 17:43:44,533 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:44,535 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:44,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:44,537 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:7 [2018-11-18 17:43:44,540 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 15 treesize of output 11 [2018-11-18 17:43:44,542 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 11 treesize of output 3 [2018-11-18 17:43:44,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:44,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:44,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:44,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-18 17:43:44,555 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 17:43:44,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:43:44,591 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 19 treesize of output 11 [2018-11-18 17:43:44,594 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 11 treesize of output 3 [2018-11-18 17:43:44,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:44,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:44,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:43:44,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:19 [2018-11-18 17:43:44,632 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 13 treesize of output 11 [2018-11-18 17:43:44,634 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 7 treesize of output 3 [2018-11-18 17:43:44,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:44,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:44,637 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 13 treesize of output 11 [2018-11-18 17:43:44,639 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 7 treesize of output 3 [2018-11-18 17:43:44,639 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:44,641 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:44,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:43:44,650 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:7 [2018-11-18 17:43:44,664 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 17:43:44,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 17:43:44,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2018-11-18 17:43:44,689 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 17:43:44,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 17:43:44,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 17:43:44,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-18 17:43:44,690 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 13 states. [2018-11-18 17:43:44,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:43:44,817 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2018-11-18 17:43:44,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 17:43:44,818 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2018-11-18 17:43:44,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:43:44,818 INFO L225 Difference]: With dead ends: 109 [2018-11-18 17:43:44,819 INFO L226 Difference]: Without dead ends: 74 [2018-11-18 17:43:44,819 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-11-18 17:43:44,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-18 17:43:44,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2018-11-18 17:43:44,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-18 17:43:44,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2018-11-18 17:43:44,824 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 39 [2018-11-18 17:43:44,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:43:44,825 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2018-11-18 17:43:44,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 17:43:44,825 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2018-11-18 17:43:44,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 17:43:44,825 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:43:44,826 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-11-18 17:43:44,826 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:43:44,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:43:44,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1522068057, now seen corresponding path program 1 times [2018-11-18 17:43:44,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:43:44,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:43:44,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:43:44,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:43:44,827 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:43:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:43:45,013 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:43:45,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:43:45,013 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:43:45,013 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-11-18 17:43:45,014 INFO L202 CegarAbsIntRunner]: [4], [5], [9], [15], [17], [21], [23], [26], [28], [31], [33], [35], [41], [43], [47], [51], [55], [57], [60], [62], [65], [72], [76], [82], [85], [111], [114], [115], [116] [2018-11-18 17:43:45,015 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:43:45,015 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:43:45,075 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 17:43:45,075 INFO L272 AbstractInterpreter]: Visited 29 different actions 59 times. Merged at 17 different actions 25 times. Never widened. Performed 479 root evaluator evaluations with a maximum evaluation depth of 3. Performed 479 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 5 different actions. Largest state had 41 variables. [2018-11-18 17:43:45,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:43:45,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 17:43:45,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:43:45,089 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:43:45,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:43:45,104 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 17:43:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:43:45,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:43:45,130 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 17:43:45,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:45,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:45,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 17:43:45,162 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 17:43:45,163 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 17:43:45,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:45,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:45,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:45,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-18 17:43:45,191 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:43:45,192 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:43:45,192 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 17:43:45,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:45,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:45,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-11-18 17:43:45,224 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 19 treesize of output 20 [2018-11-18 17:43:45,225 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 17:43:45,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:45,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:45,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:45,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-18 17:43:45,309 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:43:45,326 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 6 case distinctions, treesize of input 26 treesize of output 64 [2018-11-18 17:43:45,333 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 44 treesize of output 42 [2018-11-18 17:43:45,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:45,413 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:43:45,414 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 21 [2018-11-18 17:43:45,414 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:45,434 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:43:45,438 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 2 case distinctions, treesize of input 24 treesize of output 29 [2018-11-18 17:43:45,439 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-18 17:43:45,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 17:43:45,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-18 17:43:45,472 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:95 [2018-11-18 17:43:45,607 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:43:45,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2018-11-18 17:43:45,614 INFO L477 Elim1Store]: Elim1 applied some 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 15 treesize of output 18 [2018-11-18 17:43:45,615 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 17:43:45,620 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 5 treesize of output 1 [2018-11-18 17:43:45,620 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:45,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:45,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:45,623 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-11-18 17:43:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:43:45,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:43:45,772 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 63 treesize of output 40 [2018-11-18 17:43:45,782 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 9 treesize of output 8 [2018-11-18 17:43:45,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:45,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2018-11-18 17:43:45,797 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 20 treesize of output 14 [2018-11-18 17:43:45,798 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:45,806 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-11-18 17:43:45,807 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:45,813 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-11-18 17:43:45,813 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:45,816 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:43:45,818 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 17 treesize of output 15 [2018-11-18 17:43:45,819 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 6 treesize of output 1 [2018-11-18 17:43:45,819 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:45,822 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:45,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 17:43:45,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 17:43:45,833 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:69, output treesize:27 [2018-11-18 17:43:45,893 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:43:45,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 17:43:45,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 13] total 34 [2018-11-18 17:43:45,912 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 17:43:45,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-18 17:43:45,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-18 17:43:45,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2018-11-18 17:43:45,913 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 28 states. [2018-11-18 17:43:46,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:43:46,890 INFO L93 Difference]: Finished difference Result 192 states and 219 transitions. [2018-11-18 17:43:46,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-18 17:43:46,890 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2018-11-18 17:43:46,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:43:46,891 INFO L225 Difference]: With dead ends: 192 [2018-11-18 17:43:46,891 INFO L226 Difference]: Without dead ends: 182 [2018-11-18 17:43:46,892 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1254 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=772, Invalid=3920, Unknown=0, NotChecked=0, Total=4692 [2018-11-18 17:43:46,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-18 17:43:46,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 101. [2018-11-18 17:43:46,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-18 17:43:46,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2018-11-18 17:43:46,899 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 39 [2018-11-18 17:43:46,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:43:46,899 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2018-11-18 17:43:46,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-18 17:43:46,900 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2018-11-18 17:43:46,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 17:43:46,900 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:43:46,900 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:43:46,900 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:43:46,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:43:46,901 INFO L82 PathProgramCache]: Analyzing trace with hash 845914257, now seen corresponding path program 1 times [2018-11-18 17:43:46,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:43:46,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:43:46,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:43:46,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:43:46,902 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:43:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:43:47,108 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:43:47,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:43:47,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:43:47,109 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-11-18 17:43:47,109 INFO L202 CegarAbsIntRunner]: [4], [5], [9], [15], [17], [21], [23], [26], [28], [31], [33], [35], [41], [43], [47], [51], [55], [57], [60], [62], [65], [67], [72], [76], [82], [85], [87], [111], [114], [115], [116] [2018-11-18 17:43:47,110 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:43:47,110 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:43:47,182 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 17:43:47,182 INFO L272 AbstractInterpreter]: Visited 31 different actions 86 times. Merged at 22 different actions 45 times. Never widened. Performed 674 root evaluator evaluations with a maximum evaluation depth of 3. Performed 674 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 12 fixpoints after 8 different actions. Largest state had 43 variables. [2018-11-18 17:43:47,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:43:47,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 17:43:47,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:43:47,193 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:43:47,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:43:47,204 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 17:43:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:43:47,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:43:47,226 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 17:43:47,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:47,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:47,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 17:43:47,257 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:43:47,257 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:43:47,258 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 17:43:47,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:47,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:47,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-11-18 17:43:47,284 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 17:43:47,286 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 10 treesize of output 9 [2018-11-18 17:43:47,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:47,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:47,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:47,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-11-18 17:43:47,320 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 36 treesize of output 30 [2018-11-18 17:43:47,323 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 17:43:47,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:47,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:47,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:47,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:14 [2018-11-18 17:43:47,405 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 29 treesize of output 22 [2018-11-18 17:43:47,407 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:43:47,408 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 22 treesize of output 19 [2018-11-18 17:43:47,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:47,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:47,421 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 17:43:47,425 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 17:43:47,425 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:47,430 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:47,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:47,435 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:45, output treesize:26 [2018-11-18 17:43:47,485 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 23 treesize of output 24 [2018-11-18 17:43:47,489 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 17:43:47,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:47,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:47,505 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 23 treesize of output 24 [2018-11-18 17:43:47,506 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 17:43:47,506 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:47,510 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:47,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:47,517 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:52, output treesize:22 [2018-11-18 17:43:47,541 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 15 treesize of output 11 [2018-11-18 17:43:47,543 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 11 treesize of output 3 [2018-11-18 17:43:47,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:47,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:47,547 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 15 treesize of output 11 [2018-11-18 17:43:47,548 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 11 treesize of output 3 [2018-11-18 17:43:47,548 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:47,549 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:47,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:47,551 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-18 17:43:47,555 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:43:47,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:43:47,685 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 39 treesize of output 31 [2018-11-18 17:43:47,695 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 17:43:47,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:47,704 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 20 treesize of output 16 [2018-11-18 17:43:47,705 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 16 treesize of output 3 [2018-11-18 17:43:47,706 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:47,706 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:47,707 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 19 treesize of output 17 [2018-11-18 17:43:47,709 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 8 treesize of output 1 [2018-11-18 17:43:47,709 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:47,711 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:47,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-18 17:43:47,729 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 4 xjuncts. [2018-11-18 17:43:47,729 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:79, output treesize:54 [2018-11-18 17:43:51,905 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 231 treesize of output 123 [2018-11-18 17:43:51,931 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 17:43:51,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:51,971 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 98 treesize of output 86 [2018-11-18 17:43:51,974 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 72 treesize of output 71 [2018-11-18 17:43:51,975 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:52,025 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:43:52,026 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 71 treesize of output 76 [2018-11-18 17:43:52,026 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:52,068 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 0 case distinctions, treesize of input 72 treesize of output 59 [2018-11-18 17:43:52,094 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:43:52,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2018-11-18 17:43:52,102 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-18 17:43:52,120 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 29 treesize of output 25 [2018-11-18 17:43:52,125 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 12 [2018-11-18 17:43:52,125 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-18 17:43:52,130 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:43:52,131 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 27 treesize of output 25 [2018-11-18 17:43:52,133 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 8 treesize of output 1 [2018-11-18 17:43:52,133 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:52,136 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:52,147 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:52,196 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 75 [2018-11-18 17:43:52,271 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:43:52,272 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:43:52,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 65 [2018-11-18 17:43:52,279 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-11-18 17:43:52,322 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 51 treesize of output 45 [2018-11-18 17:43:52,324 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 8 treesize of output 1 [2018-11-18 17:43:52,324 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:52,328 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:52,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 58 [2018-11-18 17:43:52,371 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:43:52,572 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:43:52,573 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_15 term size 36 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.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.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 17:43:52,575 INFO L168 Benchmark]: Toolchain (without parser) took 12283.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.7 MB). Free memory was 956.6 MB in the beginning and 995.3 MB in the end (delta: -38.8 MB). Peak memory consumption was 180.9 MB. Max. memory is 11.5 GB. [2018-11-18 17:43:52,576 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:43:52,576 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -171.2 MB). Peak memory consumption was 35.7 MB. Max. memory is 11.5 GB. [2018-11-18 17:43:52,577 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.87 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 17:43:52,577 INFO L168 Benchmark]: Boogie Preprocessor took 18.83 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 17:43:52,577 INFO L168 Benchmark]: RCFGBuilder took 221.53 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: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2018-11-18 17:43:52,577 INFO L168 Benchmark]: TraceAbstraction took 11697.49 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 85.5 MB). Free memory was 1.1 GB in the beginning and 995.3 MB in the end (delta: 105.2 MB). Peak memory consumption was 190.6 MB. Max. memory is 11.5 GB. [2018-11-18 17:43:52,579 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 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 322.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -171.2 MB). Peak memory consumption was 35.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.87 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.83 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 221.53 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: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11697.49 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 85.5 MB). Free memory was 1.1 GB in the beginning and 995.3 MB in the end (delta: 105.2 MB). Peak memory consumption was 190.6 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_15 term size 36 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_prenex_15 term size 36: 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 17:43:53,989 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 17:43:53,990 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 17:43:53,997 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 17:43:53,997 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 17:43:53,998 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 17:43:53,999 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 17:43:54,000 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 17:43:54,001 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 17:43:54,002 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 17:43:54,002 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 17:43:54,002 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 17:43:54,003 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 17:43:54,004 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 17:43:54,005 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 17:43:54,005 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 17:43:54,006 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 17:43:54,007 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 17:43:54,008 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 17:43:54,010 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 17:43:54,011 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 17:43:54,012 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 17:43:54,014 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 17:43:54,014 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 17:43:54,014 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 17:43:54,015 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 17:43:54,015 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 17:43:54,016 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 17:43:54,016 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 17:43:54,018 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 17:43:54,018 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 17:43:54,018 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 17:43:54,018 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 17:43:54,019 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 17:43:54,019 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 17:43:54,020 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 17:43:54,020 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-18 17:43:54,030 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 17:43:54,030 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 17:43:54,031 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 17:43:54,031 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 17:43:54,031 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 17:43:54,031 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 17:43:54,032 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 17:43:54,032 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 17:43:54,032 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 17:43:54,032 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 17:43:54,032 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 17:43:54,032 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 17:43:54,033 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 17:43:54,033 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 17:43:54,034 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 17:43:54,034 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 17:43:54,034 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 17:43:54,034 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 17:43:54,034 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 17:43:54,034 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 17:43:54,034 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 17:43:54,035 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 17:43:54,035 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 17:43:54,035 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 17:43:54,035 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 17:43:54,035 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 17:43:54,035 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 17:43:54,035 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 17:43:54,035 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 17:43:54,035 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 17:43:54,035 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 17:43:54,035 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-18 17:43:54,036 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 17:43:54,036 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 17:43:54,036 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 17:43:54,036 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_ad44a58d-3f8c-41fd-bef7-0edaffce4526/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 ! call(__VERIFIER_error())) ) 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 -> a6926cb8b218b88766a46625572033d3072b3110 [2018-11-18 17:43:54,064 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 17:43:54,072 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 17:43:54,074 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 17:43:54,075 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 17:43:54,075 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 17:43:54,076 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/bin-2019/utaipan/../../sv-benchmarks/c/list-properties/splice_true-unreach-call_false-valid-memtrack.i [2018-11-18 17:43:54,110 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/bin-2019/utaipan/data/ea2546ee4/395e71277c7f4f778d88f7285b882d32/FLAGb4454be73 [2018-11-18 17:43:54,435 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 17:43:54,436 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/sv-benchmarks/c/list-properties/splice_true-unreach-call_false-valid-memtrack.i [2018-11-18 17:43:54,444 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/bin-2019/utaipan/data/ea2546ee4/395e71277c7f4f778d88f7285b882d32/FLAGb4454be73 [2018-11-18 17:43:54,451 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/bin-2019/utaipan/data/ea2546ee4/395e71277c7f4f778d88f7285b882d32 [2018-11-18 17:43:54,453 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 17:43:54,454 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 17:43:54,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 17:43:54,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 17:43:54,458 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 17:43:54,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:43:54" (1/1) ... [2018-11-18 17:43:54,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f448b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:43:54, skipping insertion in model container [2018-11-18 17:43:54,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:43:54" (1/1) ... [2018-11-18 17:43:54,466 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 17:43:54,492 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 17:43:54,688 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:43:54,697 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 17:43:54,729 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:43:54,814 INFO L195 MainTranslator]: Completed translation [2018-11-18 17:43:54,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:43:54 WrapperNode [2018-11-18 17:43:54,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 17:43:54,815 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 17:43:54,815 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 17:43:54,815 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 17:43:54,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:43:54" (1/1) ... [2018-11-18 17:43:54,831 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:43:54" (1/1) ... [2018-11-18 17:43:54,836 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 17:43:54,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 17:43:54,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 17:43:54,836 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 17:43:54,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:43:54" (1/1) ... [2018-11-18 17:43:54,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:43:54" (1/1) ... [2018-11-18 17:43:54,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:43:54" (1/1) ... [2018-11-18 17:43:54,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:43:54" (1/1) ... [2018-11-18 17:43:54,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:43:54" (1/1) ... [2018-11-18 17:43:54,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:43:54" (1/1) ... [2018-11-18 17:43:54,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:43:54" (1/1) ... [2018-11-18 17:43:54,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 17:43:54,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 17:43:54,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 17:43:54,864 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 17:43:54,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:43:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/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 17:43:54,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 17:43:54,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 17:43:54,901 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 17:43:54,901 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-18 17:43:54,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 17:43:54,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 17:43:54,901 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 17:43:54,901 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 17:43:54,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 17:43:54,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 17:43:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 17:43:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 17:43:54,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 17:43:55,116 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 17:43:55,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:43:55 BoogieIcfgContainer [2018-11-18 17:43:55,117 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 17:43:55,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 17:43:55,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 17:43:55,119 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 17:43:55,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:43:54" (1/3) ... [2018-11-18 17:43:55,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@225415e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:43:55, skipping insertion in model container [2018-11-18 17:43:55,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:43:54" (2/3) ... [2018-11-18 17:43:55,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@225415e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:43:55, skipping insertion in model container [2018-11-18 17:43:55,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:43:55" (3/3) ... [2018-11-18 17:43:55,122 INFO L112 eAbstractionObserver]: Analyzing ICFG splice_true-unreach-call_false-valid-memtrack.i [2018-11-18 17:43:55,127 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 17:43:55,132 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 17:43:55,140 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 17:43:55,159 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 17:43:55,160 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 17:43:55,160 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 17:43:55,160 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 17:43:55,160 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 17:43:55,160 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 17:43:55,160 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 17:43:55,161 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 17:43:55,161 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 17:43:55,171 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-11-18 17:43:55,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 17:43:55,175 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:43:55,176 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 17:43:55,178 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:43:55,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:43:55,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1925325351, now seen corresponding path program 1 times [2018-11-18 17:43:55,184 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:43:55,184 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/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 17:43:55,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:43:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:43:55,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:43:55,248 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 17:43:55,248 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:43:55,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:43:55,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 17:43:55,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 17:43:55,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 17:43:55,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 17:43:55,261 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 2 states. [2018-11-18 17:43:55,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:43:55,274 INFO L93 Difference]: Finished difference Result 60 states and 82 transitions. [2018-11-18 17:43:55,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 17:43:55,275 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-18 17:43:55,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:43:55,279 INFO L225 Difference]: With dead ends: 60 [2018-11-18 17:43:55,279 INFO L226 Difference]: Without dead ends: 30 [2018-11-18 17:43:55,282 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 17:43:55,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-18 17:43:55,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-18 17:43:55,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 17:43:55,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2018-11-18 17:43:55,307 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 17 [2018-11-18 17:43:55,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:43:55,307 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2018-11-18 17:43:55,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 17:43:55,307 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2018-11-18 17:43:55,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 17:43:55,308 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:43:55,308 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] [2018-11-18 17:43:55,308 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:43:55,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:43:55,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1087487377, now seen corresponding path program 1 times [2018-11-18 17:43:55,309 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:43:55,309 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/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 17:43:55,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:43:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:43:55,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:43:55,441 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 17:43:55,444 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 17:43:55,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:55,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:55,454 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 17:43:55,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2018-11-18 17:43:55,470 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 17:43:55,470 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:43:55,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:43:55,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:43:55,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:43:55,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:43:55,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:43:55,475 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 5 states. [2018-11-18 17:43:55,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:43:55,571 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2018-11-18 17:43:55,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:43:55,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-18 17:43:55,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:43:55,572 INFO L225 Difference]: With dead ends: 56 [2018-11-18 17:43:55,572 INFO L226 Difference]: Without dead ends: 40 [2018-11-18 17:43:55,573 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:43:55,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-18 17:43:55,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2018-11-18 17:43:55,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-18 17:43:55,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-11-18 17:43:55,577 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 20 [2018-11-18 17:43:55,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:43:55,578 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-11-18 17:43:55,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:43:55,578 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-18 17:43:55,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 17:43:55,578 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:43:55,579 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:43:55,579 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:43:55,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:43:55,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1171528921, now seen corresponding path program 1 times [2018-11-18 17:43:55,579 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:43:55,580 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/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 17:43:55,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:43:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:43:55,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:43:55,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:43:55,624 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:43:55,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:43:55,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:43:55,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:43:55,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:43:55,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:43:55,626 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 3 states. [2018-11-18 17:43:55,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:43:55,643 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2018-11-18 17:43:55,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:43:55,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 17:43:55,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:43:55,645 INFO L225 Difference]: With dead ends: 76 [2018-11-18 17:43:55,645 INFO L226 Difference]: Without dead ends: 54 [2018-11-18 17:43:55,645 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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 17:43:55,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-18 17:43:55,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2018-11-18 17:43:55,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-18 17:43:55,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2018-11-18 17:43:55,650 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 26 [2018-11-18 17:43:55,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:43:55,650 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-11-18 17:43:55,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:43:55,650 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-18 17:43:55,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 17:43:55,651 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:43:55,651 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:43:55,651 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:43:55,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:43:55,651 INFO L82 PathProgramCache]: Analyzing trace with hash -2102370021, now seen corresponding path program 1 times [2018-11-18 17:43:55,652 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:43:55,652 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/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 17:43:55,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:43:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:43:55,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:43:55,741 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 18 treesize of output 14 [2018-11-18 17:43:55,744 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 14 treesize of output 6 [2018-11-18 17:43:55,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:55,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:55,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:55,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:6 [2018-11-18 17:43:55,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 17:43:55,754 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:43:55,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:43:55,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:43:55,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:43:55,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:43:55,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:43:55,756 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 6 states. [2018-11-18 17:43:55,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:43:55,825 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2018-11-18 17:43:55,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 17:43:55,826 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-18 17:43:55,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:43:55,826 INFO L225 Difference]: With dead ends: 55 [2018-11-18 17:43:55,826 INFO L226 Difference]: Without dead ends: 45 [2018-11-18 17:43:55,827 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-18 17:43:55,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-18 17:43:55,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-18 17:43:55,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-18 17:43:55,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2018-11-18 17:43:55,833 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 26 [2018-11-18 17:43:55,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:43:55,833 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2018-11-18 17:43:55,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:43:55,833 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2018-11-18 17:43:55,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 17:43:55,834 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:43:55,834 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:43:55,834 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:43:55,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:43:55,835 INFO L82 PathProgramCache]: Analyzing trace with hash 19420032, now seen corresponding path program 1 times [2018-11-18 17:43:55,835 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:43:55,835 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/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 17:43:55,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:43:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:43:55,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:43:55,925 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 17:43:55,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:55,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:55,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 17:43:55,963 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 17:43:55,965 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 17:43:55,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:55,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:55,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:55,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-18 17:43:56,008 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:43:56,009 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:43:56,010 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 17:43:56,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:56,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:56,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:21 [2018-11-18 17:43:56,067 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 19 treesize of output 20 [2018-11-18 17:43:56,069 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 17:43:56,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:56,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:56,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 17:43:56,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-11-18 17:43:56,245 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 26 treesize of output 24 [2018-11-18 17:43:56,248 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 13 treesize of output 5 [2018-11-18 17:43:56,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:56,256 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 17:43:56,256 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 17:43:56,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:56,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:43:56,262 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:30, output treesize:5 [2018-11-18 17:43:56,284 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:43:56,285 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:44:01,130 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-18 17:44:01,137 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 33 treesize of output 27 [2018-11-18 17:44:01,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 9 treesize of output 8 [2018-11-18 17:44:01,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:01,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2018-11-18 17:44:01,182 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 15 treesize of output 13 [2018-11-18 17:44:01,182 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:01,202 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-11-18 17:44:01,202 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:01,211 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 10 treesize of output 3 [2018-11-18 17:44:01,211 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:01,215 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:44:01,217 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 17 treesize of output 15 [2018-11-18 17:44:01,219 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 6 treesize of output 1 [2018-11-18 17:44:01,219 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:01,223 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:01,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 17:44:01,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 17:44:01,241 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:40, output treesize:27 [2018-11-18 17:44:01,319 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:44:01,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:44:01,321 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:44:01,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:44:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:44:01,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:44:01,347 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 17:44:01,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:01,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:01,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 17:44:01,401 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 17:44:01,403 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 17:44:01,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:01,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:01,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:01,412 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-11-18 17:44:01,447 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2018-11-18 17:44:01,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:01,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:01,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:18 [2018-11-18 17:44:01,531 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 19 treesize of output 20 [2018-11-18 17:44:01,533 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 17:44:01,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:01,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:01,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 17:44:01,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-18 17:44:01,710 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 26 treesize of output 24 [2018-11-18 17:44:01,713 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 17:44:01,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:01,721 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 13 treesize of output 5 [2018-11-18 17:44:01,722 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:01,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:01,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:01,727 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:30, output treesize:5 [2018-11-18 17:44:01,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:44:01,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:44:01,810 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 33 treesize of output 27 [2018-11-18 17:44:01,827 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 9 treesize of output 8 [2018-11-18 17:44:01,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:01,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2018-11-18 17:44:01,869 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 9 [2018-11-18 17:44:01,870 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:01,885 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 9 treesize of output 7 [2018-11-18 17:44:01,885 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:01,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-18 17:44:01,895 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:01,900 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:44:01,901 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 17 treesize of output 15 [2018-11-18 17:44:01,904 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 6 treesize of output 1 [2018-11-18 17:44:01,904 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:01,908 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:01,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 17:44:01,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 17:44:01,932 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:40, output treesize:27 [2018-11-18 17:44:01,969 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:44:01,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 17:44:01,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 12] total 30 [2018-11-18 17:44:01,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-18 17:44:01,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-18 17:44:01,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=757, Unknown=0, NotChecked=0, Total=870 [2018-11-18 17:44:01,986 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 30 states. [2018-11-18 17:44:04,279 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2018-11-18 17:44:08,933 WARN L180 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-11-18 17:44:15,134 WARN L180 SmtUtils]: Spent 6.12 s on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2018-11-18 17:44:23,334 WARN L180 SmtUtils]: Spent 8.08 s on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2018-11-18 17:44:29,597 WARN L180 SmtUtils]: Spent 6.21 s on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2018-11-18 17:44:40,066 WARN L180 SmtUtils]: Spent 10.23 s on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2018-11-18 17:44:46,339 WARN L180 SmtUtils]: Spent 6.12 s on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2018-11-18 17:44:52,639 WARN L180 SmtUtils]: Spent 6.15 s on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2018-11-18 17:44:52,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:44:52,705 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2018-11-18 17:44:52,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 17:44:52,705 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-11-18 17:44:52,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:44:52,707 INFO L225 Difference]: With dead ends: 88 [2018-11-18 17:44:52,708 INFO L226 Difference]: Without dead ends: 86 [2018-11-18 17:44:52,708 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 55.0s TimeCoverageRelationStatistics Valid=320, Invalid=1486, Unknown=0, NotChecked=0, Total=1806 [2018-11-18 17:44:52,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-18 17:44:52,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 57. [2018-11-18 17:44:52,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-18 17:44:52,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2018-11-18 17:44:52,716 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 30 [2018-11-18 17:44:52,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:44:52,717 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2018-11-18 17:44:52,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-18 17:44:52,717 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-11-18 17:44:52,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 17:44:52,718 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:44:52,718 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 17:44:52,718 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:44:52,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:44:52,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1277526736, now seen corresponding path program 1 times [2018-11-18 17:44:52,718 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:44:52,718 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/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 17:44:52,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:44:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:44:52,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:44:52,802 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 17:44:52,804 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 17:44:52,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:52,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:52,814 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 17:44:52,816 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 17:44:52,816 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:52,817 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:52,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:52,822 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-18 17:44:52,844 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 15 treesize of output 11 [2018-11-18 17:44:52,846 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 11 treesize of output 3 [2018-11-18 17:44:52,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:52,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:52,855 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 15 treesize of output 11 [2018-11-18 17:44:52,856 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 11 treesize of output 3 [2018-11-18 17:44:52,856 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:52,858 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:52,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:52,861 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-18 17:44:52,870 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 17:44:52,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:44:52,928 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 17:44:52,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:44:52,930 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:44:52,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:44:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:44:52,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:44:52,987 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 17:44:52,989 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 17:44:52,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:52,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:53,000 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 17:44:53,002 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 17:44:53,002 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:53,003 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:53,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:53,007 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-18 17:44:53,011 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 15 treesize of output 11 [2018-11-18 17:44:53,012 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 11 treesize of output 3 [2018-11-18 17:44:53,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:53,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:53,019 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 15 treesize of output 11 [2018-11-18 17:44:53,020 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 11 treesize of output 3 [2018-11-18 17:44:53,021 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:53,022 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:53,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:53,025 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-18 17:44:53,027 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 17:44:53,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:44:53,033 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 17:44:53,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 17:44:53,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 8, 6] total 11 [2018-11-18 17:44:53,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 17:44:53,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 17:44:53,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 17:44:53,050 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 11 states. [2018-11-18 17:44:53,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:44:53,314 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2018-11-18 17:44:53,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 17:44:53,315 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-11-18 17:44:53,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:44:53,315 INFO L225 Difference]: With dead ends: 79 [2018-11-18 17:44:53,315 INFO L226 Difference]: Without dead ends: 70 [2018-11-18 17:44:53,315 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2018-11-18 17:44:53,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-18 17:44:53,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2018-11-18 17:44:53,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-18 17:44:53,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2018-11-18 17:44:53,322 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 33 [2018-11-18 17:44:53,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:44:53,322 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2018-11-18 17:44:53,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 17:44:53,323 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2018-11-18 17:44:53,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 17:44:53,323 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:44:53,323 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:44:53,324 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:44:53,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:44:53,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1330506077, now seen corresponding path program 1 times [2018-11-18 17:44:53,325 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:44:53,325 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/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 17:44:53,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:44:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:44:53,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:44:53,381 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 17:44:53,382 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:44:53,387 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 17:44:53,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:44:53,389 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:44:53,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:44:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:44:53,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:44:53,409 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 17:44:53,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:44:53,414 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 17:44:53,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 17:44:53,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 6 [2018-11-18 17:44:53,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:44:53,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:44:53,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:44:53,430 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand 6 states. [2018-11-18 17:44:53,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:44:53,571 INFO L93 Difference]: Finished difference Result 87 states and 102 transitions. [2018-11-18 17:44:53,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 17:44:53,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-18 17:44:53,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:44:53,572 INFO L225 Difference]: With dead ends: 87 [2018-11-18 17:44:53,572 INFO L226 Difference]: Without dead ends: 81 [2018-11-18 17:44:53,573 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-18 17:44:53,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-18 17:44:53,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 63. [2018-11-18 17:44:53,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-18 17:44:53,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2018-11-18 17:44:53,586 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 33 [2018-11-18 17:44:53,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:44:53,586 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-11-18 17:44:53,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:44:53,586 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2018-11-18 17:44:53,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 17:44:53,587 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:44:53,587 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-11-18 17:44:53,587 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:44:53,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:44:53,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1008301211, now seen corresponding path program 2 times [2018-11-18 17:44:53,588 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:44:53,588 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/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 17:44:53,610 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 17:44:53,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 17:44:53,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 17:44:53,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:44:53,651 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 17:44:53,651 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:44:53,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:44:53,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:44:53,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:44:53,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:44:53,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:44:53,654 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand 3 states. [2018-11-18 17:44:53,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:44:53,672 INFO L93 Difference]: Finished difference Result 128 states and 152 transitions. [2018-11-18 17:44:53,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:44:53,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 17:44:53,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:44:53,674 INFO L225 Difference]: With dead ends: 128 [2018-11-18 17:44:53,674 INFO L226 Difference]: Without dead ends: 75 [2018-11-18 17:44:53,674 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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 17:44:53,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-18 17:44:53,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2018-11-18 17:44:53,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-18 17:44:53,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-11-18 17:44:53,684 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 34 [2018-11-18 17:44:53,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:44:53,685 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2018-11-18 17:44:53,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:44:53,686 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-11-18 17:44:53,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 17:44:53,686 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:44:53,686 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, 1] [2018-11-18 17:44:53,687 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:44:53,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:44:53,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1145876749, now seen corresponding path program 1 times [2018-11-18 17:44:53,687 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:44:53,687 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/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 17:44:53,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:44:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:44:53,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:44:53,748 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 17:44:53,748 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:44:53,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:44:53,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 17:44:53,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 17:44:53,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 17:44:53,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 17:44:53,754 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 4 states. [2018-11-18 17:44:53,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:44:53,804 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-11-18 17:44:53,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:44:53,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-18 17:44:53,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:44:53,805 INFO L225 Difference]: With dead ends: 71 [2018-11-18 17:44:53,805 INFO L226 Difference]: Without dead ends: 57 [2018-11-18 17:44:53,806 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:44:53,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-18 17:44:53,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-18 17:44:53,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-18 17:44:53,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-11-18 17:44:53,814 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 36 [2018-11-18 17:44:53,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:44:53,814 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-11-18 17:44:53,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 17:44:53,814 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-11-18 17:44:53,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 17:44:53,815 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:44:53,815 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-11-18 17:44:53,815 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:44:53,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:44:53,815 INFO L82 PathProgramCache]: Analyzing trace with hash 958941673, now seen corresponding path program 1 times [2018-11-18 17:44:53,815 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:44:53,815 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/bin-2019/utaipan/cvc4nyu Starting monitored process 14 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 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:44:53,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:44:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:44:53,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:44:53,906 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 17:44:53,909 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 17:44:53,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:53,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:53,933 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 17:44:53,935 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 17:44:53,936 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:53,938 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:53,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:53,950 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:22 [2018-11-18 17:44:53,966 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 29 treesize of output 20 [2018-11-18 17:44:53,967 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 17:44:53,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:53,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:53,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:53,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:23 [2018-11-18 17:44:53,999 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 25 treesize of output 21 [2018-11-18 17:44:54,000 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 21 treesize of output 13 [2018-11-18 17:44:54,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,010 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 21 treesize of output 17 [2018-11-18 17:44:54,013 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 17 treesize of output 9 [2018-11-18 17:44:54,013 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,015 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,017 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:9 [2018-11-18 17:44:54,042 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 17:44:54,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:44:54,248 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 30 treesize of output 22 [2018-11-18 17:44:54,252 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 13 treesize of output 5 [2018-11-18 17:44:54,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2018-11-18 17:44:54,277 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 29 treesize of output 23 [2018-11-18 17:44:54,277 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,295 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 23 treesize of output 15 [2018-11-18 17:44:54,296 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,309 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-11-18 17:44:54,309 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,316 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:44:54,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:44:54,331 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:48, output treesize:19 [2018-11-18 17:44:54,405 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 13 treesize of output 11 [2018-11-18 17:44:54,407 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 7 treesize of output 3 [2018-11-18 17:44:54,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,410 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 13 treesize of output 11 [2018-11-18 17:44:54,412 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 7 treesize of output 3 [2018-11-18 17:44:54,412 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,413 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:44:54,426 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:7 [2018-11-18 17:44:54,448 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 17:44:54,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:44:54,450 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:44:54,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:44:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:44:54,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:44:54,479 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 17:44:54,481 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 17:44:54,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,503 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 17:44:54,506 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 17:44:54,506 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,508 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,528 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:22 [2018-11-18 17:44:54,532 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 29 treesize of output 20 [2018-11-18 17:44:54,534 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 17:44:54,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:23 [2018-11-18 17:44:54,545 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 25 treesize of output 21 [2018-11-18 17:44:54,547 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 21 treesize of output 13 [2018-11-18 17:44:54,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,554 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 21 treesize of output 17 [2018-11-18 17:44:54,555 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 17 treesize of output 9 [2018-11-18 17:44:54,555 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,557 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,558 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:9 [2018-11-18 17:44:54,559 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 15 treesize of output 11 [2018-11-18 17:44:54,561 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 11 treesize of output 3 [2018-11-18 17:44:54,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-18 17:44:54,579 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 17:44:54,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:44:54,681 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 21 treesize of output 13 [2018-11-18 17:44:54,683 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 13 treesize of output 5 [2018-11-18 17:44:54,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:44:54,691 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:19 [2018-11-18 17:44:54,733 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 13 treesize of output 11 [2018-11-18 17:44:54,734 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 7 treesize of output 3 [2018-11-18 17:44:54,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,737 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 13 treesize of output 11 [2018-11-18 17:44:54,739 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 7 treesize of output 3 [2018-11-18 17:44:54,739 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,740 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:54,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:44:54,752 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:7 [2018-11-18 17:44:54,755 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 17:44:54,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 17:44:54,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9, 8] total 20 [2018-11-18 17:44:54,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 17:44:54,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 17:44:54,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-11-18 17:44:54,771 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 20 states. [2018-11-18 17:44:55,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:44:55,100 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2018-11-18 17:44:55,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 17:44:55,101 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2018-11-18 17:44:55,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:44:55,101 INFO L225 Difference]: With dead ends: 102 [2018-11-18 17:44:55,102 INFO L226 Difference]: Without dead ends: 67 [2018-11-18 17:44:55,102 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2018-11-18 17:44:55,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-18 17:44:55,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2018-11-18 17:44:55,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-18 17:44:55,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-11-18 17:44:55,109 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 37 [2018-11-18 17:44:55,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:44:55,109 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-11-18 17:44:55,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 17:44:55,109 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-11-18 17:44:55,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 17:44:55,110 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:44:55,110 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:44:55,110 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:44:55,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:44:55,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1191967295, now seen corresponding path program 1 times [2018-11-18 17:44:55,111 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:44:55,111 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ad44a58d-3f8c-41fd-bef7-0edaffce4526/bin-2019/utaipan/cvc4nyu Starting monitored process 16 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 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:44:55,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:44:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:44:55,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:44:55,202 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 17:44:55,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:55,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:55,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 17:44:55,219 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:44:55,219 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:44:55,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 17:44:55,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:55,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:55,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:14 [2018-11-18 17:44:55,239 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 17:44:55,241 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 10 treesize of output 9 [2018-11-18 17:44:55,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:55,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:55,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:55,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-11-18 17:44:55,274 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 36 treesize of output 30 [2018-11-18 17:44:55,276 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 17:44:55,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:55,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:55,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:55,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:14 [2018-11-18 17:44:55,346 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 17:44:55,348 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 17:44:55,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:55,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:55,363 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 27 treesize of output 20 [2018-11-18 17:44:55,365 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 12 [2018-11-18 17:44:55,365 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:55,369 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:55,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:55,375 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:22 [2018-11-18 17:44:55,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 21 treesize of output 22 [2018-11-18 17:44:55,434 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 17:44:55,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:55,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:55,472 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 17:44:55,474 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 17:44:55,474 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:55,482 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:55,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:55,499 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:48, output treesize:18 [2018-11-18 17:44:55,538 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 15 treesize of output 11 [2018-11-18 17:44:55,539 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 11 treesize of output 3 [2018-11-18 17:44:55,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:55,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:55,546 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 15 treesize of output 11 [2018-11-18 17:44:55,548 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 11 treesize of output 3 [2018-11-18 17:44:55,548 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:55,549 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:55,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:55,551 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-18 17:44:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:44:55,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:44:56,002 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 39 treesize of output 31 [2018-11-18 17:44:56,027 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 17:44:56,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:56,051 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 19 treesize of output 17 [2018-11-18 17:44:56,054 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 8 treesize of output 1 [2018-11-18 17:44:56,054 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:56,059 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:56,061 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 20 treesize of output 16 [2018-11-18 17:44:56,063 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 16 treesize of output 3 [2018-11-18 17:44:56,064 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:56,065 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:44:56,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-18 17:44:56,124 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 4 xjuncts. [2018-11-18 17:44:56,124 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:79, output treesize:54 [2018-11-18 17:44:56,840 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 231 treesize of output 123 [2018-11-18 17:44:56,944 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-18 17:44:56,949 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 17:44:56,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:44:57,177 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 181 treesize of output 144 [2018-11-18 17:44:57,187 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 118 treesize of output 117 [2018-11-18 17:44:57,187 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:45:20,709 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:45:20,771 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 2 case distinctions, treesize of input 117 treesize of output 130 [2018-11-18 17:45:20,772 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-18 17:45:58,118 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:45:58,119 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 115 treesize of output 116 [2018-11-18 17:45:58,120 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 17:46:46,054 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:46:46,060 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:46:46,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 121 [2018-11-18 17:46:46,061 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 17:47:21,354 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 118 treesize of output 98 [2018-11-18 17:47:21,765 WARN L180 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2018-11-18 17:47:21,792 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:47:21,794 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:47:21,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 72 [2018-11-18 17:47:21,859 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-11-18 17:47:22,107 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 57 treesize of output 49 [2018-11-18 17:47:22,113 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:47:22,114 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 4 [2018-11-18 17:47:22,114 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 17:47:22,124 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:47:22,291 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 44 treesize of output 40 [2018-11-18 17:47:22,301 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 12 [2018-11-18 17:47:22,301 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-11-18 17:47:22,316 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:47:22,319 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 44 treesize of output 40 [2018-11-18 17:47:22,331 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 12 [2018-11-18 17:47:22,331 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-11-18 17:47:22,354 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:47:22,358 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 17:47:22,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 25 [2018-11-18 17:47:22,392 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-11-18 17:47:22,412 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:47:22,415 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 42 treesize of output 40 [2018-11-18 17:47:22,419 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 8 treesize of output 1 [2018-11-18 17:47:22,419 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-18 17:47:22,432 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:47:22,469 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:47:28,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, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 98 [2018-11-18 17:47:28,899 WARN L180 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2018-11-18 17:47:28,940 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:47:28,954 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:47:29,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 57 treesize of output 100 [2018-11-18 17:47:29,046 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-11-18 17:47:29,294 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:47:29,296 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:47:29,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 72 [2018-11-18 17:47:29,363 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 4 xjuncts. [2018-11-18 17:47:29,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 57 [2018-11-18 17:47:29,695 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:47:29,718 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:47:29,719 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:47:29,720 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:47:29,721 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 43 treesize of output 36 [2018-11-18 17:47:29,721 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-18 17:47:29,789 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:47:29,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 44 [2018-11-18 17:47:29,803 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-11-18 17:47:29,839 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:47:30,138 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 44 [2018-11-18 17:47:30,140 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 8 treesize of output 1 [2018-11-18 17:47:30,140 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-18 17:47:30,155 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:47:30,158 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 44 [2018-11-18 17:47:30,169 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 12 [2018-11-18 17:47:30,169 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-11-18 17:47:30,185 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:47:30,188 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 50 treesize of output 44 [2018-11-18 17:47:30,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 25 [2018-11-18 17:47:30,212 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-11-18 17:47:30,231 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:47:30,234 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 44 [2018-11-18 17:47:30,243 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 12 [2018-11-18 17:47:30,244 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-11-18 17:47:30,261 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:47:30,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 63 [2018-11-18 17:47:30,382 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:47:30,385 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 58 treesize of output 42 [2018-11-18 17:47:30,385 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-18 17:47:30,454 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:47:30,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 39 [2018-11-18 17:47:30,463 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2018-11-18 17:47:30,534 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2018-11-18 17:47:30,534 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-18 17:47:30,563 INFO L267 ElimStorePlain]: Start of recursive call 35: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:47:30,592 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:47:37,003 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:47:37,126 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 6 case distinctions, treesize of input 122 treesize of output 109 [2018-11-18 17:47:38,156 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 162 DAG size of output: 126 [2018-11-18 17:47:38,175 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:47:38,176 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:47:38,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 72 [2018-11-18 17:47:38,235 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 4 xjuncts. [2018-11-18 17:47:38,853 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:47:38,871 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:47:38,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 57 treesize of output 100 [2018-11-18 17:47:38,938 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 2 xjuncts. [2018-11-18 17:47:39,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 65 [2018-11-18 17:47:39,726 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:47:39,750 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:47:39,751 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:47:39,752 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:47:39,753 INFO L303 Elim1Store]: Index analysis took 105 ms [2018-11-18 17:47:39,753 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 47 treesize of output 36 [2018-11-18 17:47:39,753 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-18 17:47:39,947 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:47:40,024 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:47:40,025 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:47:40,026 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:47:40,027 INFO L303 Elim1Store]: Index analysis took 110 ms [2018-11-18 17:47:40,027 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 42 treesize of output 35 [2018-11-18 17:47:40,027 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-18 17:47:40,165 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:47:40,166 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:47:40,166 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 29 [2018-11-18 17:47:40,167 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-18 17:47:40,300 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:47:40,300 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:47:40,301 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 37 treesize of output 28 [2018-11-18 17:47:40,301 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-18 17:47:40,356 INFO L267 ElimStorePlain]: Start of recursive call 42: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 17:47:43,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 53 [2018-11-18 17:47:43,070 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:47:43,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 40 [2018-11-18 17:47:43,083 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 2 xjuncts. [2018-11-18 17:47:43,153 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:47:43,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2018-11-18 17:47:43,169 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 2 xjuncts. [2018-11-18 17:47:43,222 INFO L267 ElimStorePlain]: Start of recursive call 47: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-18 17:47:52,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 68 [2018-11-18 17:47:52,921 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:47:52,949 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:47:52,950 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:47:52,950 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 63 treesize of output 56 [2018-11-18 17:47:52,951 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-18 17:47:53,015 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:47:53,017 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 49 treesize of output 33 [2018-11-18 17:47:53,018 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-18 17:47:53,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 44 [2018-11-18 17:47:53,098 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 2 xjuncts. [2018-11-18 17:47:53,132 INFO L267 ElimStorePlain]: Start of recursive call 50: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:47:53,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 71 [2018-11-18 17:47:53,151 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:47:53,154 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 66 treesize of output 50 [2018-11-18 17:47:53,154 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-18 17:47:53,230 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:47:53,230 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:47:53,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 46 [2018-11-18 17:47:53,231 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-18 17:47:53,302 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:47:53,303 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 50 treesize of output 41 [2018-11-18 17:47:53,303 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-18 17:47:53,339 INFO L267 ElimStorePlain]: Start of recursive call 54: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:48:09,614 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 42 treesize of output 40 [2018-11-18 17:48:09,618 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 8 treesize of output 1 [2018-11-18 17:48:09,618 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-18 17:48:09,636 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:48:09,639 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 17:48:09,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 25 [2018-11-18 17:48:09,662 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 2 xjuncts. [2018-11-18 17:48:09,678 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:48:09,681 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 44 treesize of output 40 [2018-11-18 17:48:09,691 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 12 [2018-11-18 17:48:09,691 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 2 xjuncts. [2018-11-18 17:48:09,706 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:48:09,709 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 44 treesize of output 40 [2018-11-18 17:48:09,719 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 12 [2018-11-18 17:48:09,719 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 2 xjuncts. [2018-11-18 17:48:09,734 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:48:11,024 INFO L267 ElimStorePlain]: Start of recursive call 39: 2 dim-1 vars, 6 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 17:48:12,903 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 114 treesize of output 113 [2018-11-18 17:48:15,518 WARN L180 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 236 DAG size of output: 182 [2018-11-18 17:48:15,526 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 60 treesize of output 51 [2018-11-18 17:48:15,526 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-11-18 17:48:16,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 71 [2018-11-18 17:48:16,674 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 2 xjuncts. [2018-11-18 17:48:17,553 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:48:17,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2018-11-18 17:48:17,590 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:48:17,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 53 [2018-11-18 17:48:17,648 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 4 xjuncts. [2018-11-18 17:48:17,732 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-18 17:48:18,722 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:48:18,740 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:48:18,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 57 treesize of output 100 [2018-11-18 17:48:18,907 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 2 xjuncts. [2018-11-18 17:48:20,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 57 [2018-11-18 17:48:20,200 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:48:20,223 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:48:20,224 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:48:20,226 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:48:20,226 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 43 treesize of output 33 [2018-11-18 17:48:20,227 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-11-18 17:48:20,292 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:48:20,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 44 [2018-11-18 17:48:20,305 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 2 xjuncts. [2018-11-18 17:48:20,353 INFO L267 ElimStorePlain]: Start of recursive call 72: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:48:21,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 63 [2018-11-18 17:48:21,335 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:48:21,338 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 58 treesize of output 42 [2018-11-18 17:48:21,338 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-11-18 17:48:21,407 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:48:21,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 39 [2018-11-18 17:48:21,417 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 2 xjuncts. [2018-11-18 17:48:21,491 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2018-11-18 17:48:21,491 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-11-18 17:48:21,523 INFO L267 ElimStorePlain]: Start of recursive call 75: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:48:22,256 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 62 treesize of output 54 [2018-11-18 17:48:22,326 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 13 treesize of output 4 [2018-11-18 17:48:22,327 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-11-18 17:48:22,333 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:48:22,333 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 4 [2018-11-18 17:48:22,333 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-11-18 17:48:22,345 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:48:22,958 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 44 treesize of output 40 [2018-11-18 17:48:22,971 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 12 [2018-11-18 17:48:22,972 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 2 xjuncts. [2018-11-18 17:48:22,993 INFO L267 ElimStorePlain]: Start of recursive call 82: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:48:22,997 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 44 treesize of output 40 [2018-11-18 17:48:23,011 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 12 [2018-11-18 17:48:23,011 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 2 xjuncts. [2018-11-18 17:48:23,034 INFO L267 ElimStorePlain]: Start of recursive call 84: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:48:23,038 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 17:48:23,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 25 [2018-11-18 17:48:23,070 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 2 xjuncts. [2018-11-18 17:48:23,086 INFO L267 ElimStorePlain]: Start of recursive call 86: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:48:23,090 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 42 treesize of output 40 [2018-11-18 17:48:23,093 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 8 treesize of output 1 [2018-11-18 17:48:23,093 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-11-18 17:48:23,109 INFO L267 ElimStorePlain]: Start of recursive call 88: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:48:23,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 70 [2018-11-18 17:48:23,648 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:48:23,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 58 [2018-11-18 17:48:23,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 29 [2018-11-18 17:48:23,846 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 2 xjuncts. [2018-11-18 17:48:23,872 INFO L267 ElimStorePlain]: Start of recursive call 91: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:48:24,301 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:48:24,302 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:48:24,303 INFO L303 Elim1Store]: Index analysis took 138 ms [2018-11-18 17:48:24,303 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 37 treesize of output 31 [2018-11-18 17:48:24,303 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2018-11-18 17:48:24,606 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:48:24,633 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:48:24,634 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:48:24,637 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:48:24,638 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 42 treesize of output 32 [2018-11-18 17:48:24,638 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-11-18 17:48:24,974 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:48:25,001 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:48:25,001 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:48:25,003 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:48:25,003 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 47 treesize of output 33 [2018-11-18 17:48:25,004 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2018-11-18 17:48:46,812 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:48:46,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 40 [2018-11-18 17:48:46,825 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 2 xjuncts. [2018-11-18 17:48:46,939 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 31 [2018-11-18 17:48:46,940 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 2 xjuncts. [2018-11-18 17:48:47,073 INFO L267 ElimStorePlain]: Start of recursive call 90: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-18 17:48:48,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 75 [2018-11-18 17:48:48,602 WARN L180 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2018-11-18 17:48:48,924 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:48:48,925 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_126 term size 42 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.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 17:48:48,927 INFO L168 Benchmark]: Toolchain (without parser) took 294473.81 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 233.3 MB). Free memory was 944.4 MB in the beginning and 1.1 GB in the end (delta: -113.5 MB). Peak memory consumption was 401.6 MB. Max. memory is 11.5 GB. [2018-11-18 17:48:48,927 INFO L168 Benchmark]: CDTParser took 0.11 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 17:48:48,928 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 944.4 MB in the beginning and 1.1 GB in the end (delta: -205.3 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. [2018-11-18 17:48:48,928 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.96 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-18 17:48:48,928 INFO L168 Benchmark]: Boogie Preprocessor took 27.69 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 17:48:48,928 INFO L168 Benchmark]: RCFGBuilder took 252.88 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: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2018-11-18 17:48:48,928 INFO L168 Benchmark]: TraceAbstraction took 293809.35 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 76.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.0 MB). Peak memory consumption was 411.3 MB. Max. memory is 11.5 GB. [2018-11-18 17:48:48,930 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.11 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 360.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 944.4 MB in the beginning and 1.1 GB in the end (delta: -205.3 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.96 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.69 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 252.88 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: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 293809.35 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 76.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.0 MB). Peak memory consumption was 411.3 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_126 term size 42 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_126 term size 42: 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...