./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.14_false-unreach-call.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.14_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/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 d06f77684af1a50a152dd1d7247c10847b7d2ace ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.14_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/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 d06f77684af1a50a152dd1d7247c10847b7d2ace ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 03:57:26,024 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:57:26,025 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:57:26,031 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:57:26,031 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:57:26,032 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:57:26,033 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:57:26,034 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:57:26,035 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:57:26,036 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:57:26,036 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:57:26,037 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:57:26,037 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:57:26,038 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:57:26,039 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:57:26,039 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:57:26,040 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:57:26,040 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:57:26,042 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:57:26,042 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:57:26,043 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:57:26,044 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:57:26,045 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:57:26,045 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:57:26,045 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:57:26,046 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:57:26,046 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:57:26,047 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:57:26,047 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:57:26,048 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:57:26,048 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:57:26,049 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:57:26,049 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:57:26,049 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:57:26,050 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:57:26,050 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:57:26,051 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 03:57:26,060 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:57:26,061 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:57:26,061 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 03:57:26,062 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 03:57:26,062 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 03:57:26,062 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 03:57:26,062 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 03:57:26,062 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 03:57:26,062 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 03:57:26,062 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 03:57:26,062 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 03:57:26,063 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:57:26,063 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:57:26,063 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:57:26,063 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:57:26,064 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:57:26,064 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 03:57:26,064 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 03:57:26,064 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 03:57:26,064 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:57:26,064 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:57:26,064 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 03:57:26,064 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:57:26,065 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:57:26,065 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 03:57:26,065 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 03:57:26,065 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 03:57:26,065 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:57:26,065 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 03:57:26,065 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 03:57:26,066 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 03:57:26,066 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 03:57:26,066 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 03:57:26,066 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 03:57:26,066 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_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/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 -> d06f77684af1a50a152dd1d7247c10847b7d2ace [2018-11-10 03:57:26,090 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:57:26,099 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:57:26,102 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:57:26,103 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:57:26,103 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:57:26,104 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.14_false-unreach-call.i.cil.c [2018-11-10 03:57:26,150 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/data/fd2b80f9f/a476df73426f4896a0c793068a64bb16/FLAG5cfe5fa06 [2018-11-10 03:57:26,566 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:57:26,566 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/sv-benchmarks/c/ssh/s3_srvr.blast.14_false-unreach-call.i.cil.c [2018-11-10 03:57:26,580 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/data/fd2b80f9f/a476df73426f4896a0c793068a64bb16/FLAG5cfe5fa06 [2018-11-10 03:57:26,592 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/data/fd2b80f9f/a476df73426f4896a0c793068a64bb16 [2018-11-10 03:57:26,594 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:57:26,596 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 03:57:26,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:57:26,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:57:26,599 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:57:26,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:57:26" (1/1) ... [2018-11-10 03:57:26,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56bbfcfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:57:26, skipping insertion in model container [2018-11-10 03:57:26,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:57:26" (1/1) ... [2018-11-10 03:57:26,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:57:26,654 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:57:27,130 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:57:27,139 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:57:27,494 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:57:27,508 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:57:27,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:57:27 WrapperNode [2018-11-10 03:57:27,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:57:27,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 03:57:27,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 03:57:27,510 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 03:57:27,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:57:27" (1/1) ... [2018-11-10 03:57:27,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:57:27" (1/1) ... [2018-11-10 03:57:27,571 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 03:57:27,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:57:27,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:57:27,572 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:57:27,580 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:57:27" (1/1) ... [2018-11-10 03:57:27,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:57:27" (1/1) ... [2018-11-10 03:57:27,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:57:27" (1/1) ... [2018-11-10 03:57:27,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:57:27" (1/1) ... [2018-11-10 03:57:27,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:57:27" (1/1) ... [2018-11-10 03:57:27,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:57:27" (1/1) ... [2018-11-10 03:57:27,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:57:27" (1/1) ... [2018-11-10 03:57:27,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:57:27,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:57:27,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:57:27,648 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:57:27,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:57:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/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-10 03:57:27,697 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 03:57:27,697 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 03:57:27,697 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-11-10 03:57:27,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-11-10 03:57:27,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 03:57:27,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 03:57:27,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:57:27,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:57:28,158 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 03:57:28,159 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 03:57:28,657 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:57:28,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:57:28 BoogieIcfgContainer [2018-11-10 03:57:28,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:57:28,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 03:57:28,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 03:57:28,660 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 03:57:28,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:57:26" (1/3) ... [2018-11-10 03:57:28,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@327bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:57:28, skipping insertion in model container [2018-11-10 03:57:28,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:57:27" (2/3) ... [2018-11-10 03:57:28,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@327bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:57:28, skipping insertion in model container [2018-11-10 03:57:28,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:57:28" (3/3) ... [2018-11-10 03:57:28,663 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.14_false-unreach-call.i.cil.c [2018-11-10 03:57:28,669 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 03:57:28,674 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 03:57:28,682 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 03:57:28,708 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 03:57:28,709 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 03:57:28,709 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 03:57:28,709 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:57:28,709 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:57:28,709 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 03:57:28,709 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:57:28,710 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 03:57:28,722 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states. [2018-11-10 03:57:28,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-10 03:57:28,727 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:28,728 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:57:28,730 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:28,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:28,733 INFO L82 PathProgramCache]: Analyzing trace with hash 283188315, now seen corresponding path program 1 times [2018-11-10 03:57:28,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:28,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:28,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:28,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:28,769 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:29,020 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-10 03:57:29,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:29,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:57:29,022 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:29,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:57:29,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:57:29,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:29,045 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 4 states. [2018-11-10 03:57:29,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:29,456 INFO L93 Difference]: Finished difference Result 346 states and 581 transitions. [2018-11-10 03:57:29,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:57:29,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-10 03:57:29,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:29,467 INFO L225 Difference]: With dead ends: 346 [2018-11-10 03:57:29,467 INFO L226 Difference]: Without dead ends: 176 [2018-11-10 03:57:29,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:29,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-11-10 03:57:29,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 159. [2018-11-10 03:57:29,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-10 03:57:29,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 244 transitions. [2018-11-10 03:57:29,504 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 244 transitions. Word has length 49 [2018-11-10 03:57:29,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:29,505 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 244 transitions. [2018-11-10 03:57:29,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:57:29,505 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 244 transitions. [2018-11-10 03:57:29,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 03:57:29,507 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:29,507 INFO L375 BasicCegarLoop]: trace histogram [2, 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, 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-10 03:57:29,507 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:29,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:29,507 INFO L82 PathProgramCache]: Analyzing trace with hash 564877000, now seen corresponding path program 1 times [2018-11-10 03:57:29,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:29,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:29,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:29,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:29,509 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:29,635 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:57:29,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:29,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:57:29,636 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:29,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:57:29,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:57:29,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:29,638 INFO L87 Difference]: Start difference. First operand 159 states and 244 transitions. Second operand 4 states. [2018-11-10 03:57:29,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:29,971 INFO L93 Difference]: Finished difference Result 366 states and 567 transitions. [2018-11-10 03:57:29,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:57:29,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-11-10 03:57:29,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:29,973 INFO L225 Difference]: With dead ends: 366 [2018-11-10 03:57:29,974 INFO L226 Difference]: Without dead ends: 233 [2018-11-10 03:57:29,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:29,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-11-10 03:57:29,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 192. [2018-11-10 03:57:29,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-11-10 03:57:29,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 303 transitions. [2018-11-10 03:57:29,986 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 303 transitions. Word has length 63 [2018-11-10 03:57:29,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:29,987 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 303 transitions. [2018-11-10 03:57:29,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:57:29,987 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 303 transitions. [2018-11-10 03:57:29,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-10 03:57:29,989 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:29,989 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:57:29,989 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:29,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:29,989 INFO L82 PathProgramCache]: Analyzing trace with hash -715240359, now seen corresponding path program 1 times [2018-11-10 03:57:29,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:29,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:29,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:29,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:29,992 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:30,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:57:30,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:30,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:57:30,089 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:30,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:57:30,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:57:30,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:30,090 INFO L87 Difference]: Start difference. First operand 192 states and 303 transitions. Second operand 4 states. [2018-11-10 03:57:30,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:30,536 INFO L93 Difference]: Finished difference Result 487 states and 771 transitions. [2018-11-10 03:57:30,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:57:30,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-11-10 03:57:30,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:30,538 INFO L225 Difference]: With dead ends: 487 [2018-11-10 03:57:30,539 INFO L226 Difference]: Without dead ends: 321 [2018-11-10 03:57:30,539 INFO L605 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-10 03:57:30,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-11-10 03:57:30,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 233. [2018-11-10 03:57:30,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-10 03:57:30,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 377 transitions. [2018-11-10 03:57:30,550 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 377 transitions. Word has length 64 [2018-11-10 03:57:30,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:30,550 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 377 transitions. [2018-11-10 03:57:30,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:57:30,550 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 377 transitions. [2018-11-10 03:57:30,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 03:57:30,554 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:30,554 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:57:30,554 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:30,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:30,555 INFO L82 PathProgramCache]: Analyzing trace with hash -937887394, now seen corresponding path program 1 times [2018-11-10 03:57:30,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:30,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:30,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:30,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:30,556 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:30,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:57:30,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:30,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:57:30,639 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:30,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:57:30,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:57:30,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:30,640 INFO L87 Difference]: Start difference. First operand 233 states and 377 transitions. Second operand 4 states. [2018-11-10 03:57:30,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:30,981 INFO L93 Difference]: Finished difference Result 568 states and 918 transitions. [2018-11-10 03:57:30,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:57:30,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-11-10 03:57:30,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:30,982 INFO L225 Difference]: With dead ends: 568 [2018-11-10 03:57:30,982 INFO L226 Difference]: Without dead ends: 361 [2018-11-10 03:57:30,983 INFO L605 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-10 03:57:30,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-11-10 03:57:30,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 274. [2018-11-10 03:57:30,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-11-10 03:57:30,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 452 transitions. [2018-11-10 03:57:30,995 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 452 transitions. Word has length 65 [2018-11-10 03:57:30,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:30,995 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 452 transitions. [2018-11-10 03:57:30,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:57:30,995 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 452 transitions. [2018-11-10 03:57:30,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 03:57:30,997 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:30,997 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:57:30,997 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:30,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:30,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1234247792, now seen corresponding path program 1 times [2018-11-10 03:57:30,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:31,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:31,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:31,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:31,000 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:31,084 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 03:57:31,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:31,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:57:31,085 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:31,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:57:31,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:57:31,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:31,085 INFO L87 Difference]: Start difference. First operand 274 states and 452 transitions. Second operand 4 states. [2018-11-10 03:57:31,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:31,313 INFO L93 Difference]: Finished difference Result 539 states and 888 transitions. [2018-11-10 03:57:31,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:57:31,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-11-10 03:57:31,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:31,315 INFO L225 Difference]: With dead ends: 539 [2018-11-10 03:57:31,315 INFO L226 Difference]: Without dead ends: 291 [2018-11-10 03:57:31,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10 03:57:31,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-11-10 03:57:31,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 274. [2018-11-10 03:57:31,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-11-10 03:57:31,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 451 transitions. [2018-11-10 03:57:31,324 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 451 transitions. Word has length 93 [2018-11-10 03:57:31,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:31,324 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 451 transitions. [2018-11-10 03:57:31,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:57:31,325 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 451 transitions. [2018-11-10 03:57:31,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 03:57:31,325 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:31,325 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:57:31,326 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:31,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:31,326 INFO L82 PathProgramCache]: Analyzing trace with hash 102793569, now seen corresponding path program 1 times [2018-11-10 03:57:31,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:31,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:31,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:31,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:31,327 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:31,400 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:57:31,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:31,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:57:31,401 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:31,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:57:31,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:57:31,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:31,401 INFO L87 Difference]: Start difference. First operand 274 states and 451 transitions. Second operand 4 states. [2018-11-10 03:57:31,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:31,731 INFO L93 Difference]: Finished difference Result 687 states and 1135 transitions. [2018-11-10 03:57:31,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:57:31,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-11-10 03:57:31,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:31,733 INFO L225 Difference]: With dead ends: 687 [2018-11-10 03:57:31,733 INFO L226 Difference]: Without dead ends: 439 [2018-11-10 03:57:31,734 INFO L605 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-10 03:57:31,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-11-10 03:57:31,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 340. [2018-11-10 03:57:31,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-10 03:57:31,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 569 transitions. [2018-11-10 03:57:31,746 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 569 transitions. Word has length 94 [2018-11-10 03:57:31,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:31,746 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 569 transitions. [2018-11-10 03:57:31,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:57:31,746 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 569 transitions. [2018-11-10 03:57:31,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 03:57:31,747 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:31,748 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:57:31,748 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:31,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:31,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1987076052, now seen corresponding path program 1 times [2018-11-10 03:57:31,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:31,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:31,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:31,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:31,749 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:31,850 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 03:57:31,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:31,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:57:31,851 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:31,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:57:31,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:57:31,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:31,852 INFO L87 Difference]: Start difference. First operand 340 states and 569 transitions. Second operand 4 states. [2018-11-10 03:57:32,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:32,131 INFO L93 Difference]: Finished difference Result 669 states and 1121 transitions. [2018-11-10 03:57:32,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:57:32,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-11-10 03:57:32,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:32,133 INFO L225 Difference]: With dead ends: 669 [2018-11-10 03:57:32,133 INFO L226 Difference]: Without dead ends: 355 [2018-11-10 03:57:32,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10 03:57:32,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-11-10 03:57:32,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 340. [2018-11-10 03:57:32,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-10 03:57:32,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 568 transitions. [2018-11-10 03:57:32,143 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 568 transitions. Word has length 94 [2018-11-10 03:57:32,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:32,144 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 568 transitions. [2018-11-10 03:57:32,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:57:32,144 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 568 transitions. [2018-11-10 03:57:32,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 03:57:32,145 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:32,145 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:57:32,145 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:32,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:32,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1115795125, now seen corresponding path program 1 times [2018-11-10 03:57:32,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:32,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:32,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:32,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:32,147 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:32,211 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:57:32,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:32,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:57:32,212 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:32,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:57:32,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:57:32,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:57:32,213 INFO L87 Difference]: Start difference. First operand 340 states and 568 transitions. Second operand 3 states. [2018-11-10 03:57:32,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:32,271 INFO L93 Difference]: Finished difference Result 964 states and 1629 transitions. [2018-11-10 03:57:32,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:57:32,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-11-10 03:57:32,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:32,274 INFO L225 Difference]: With dead ends: 964 [2018-11-10 03:57:32,274 INFO L226 Difference]: Without dead ends: 650 [2018-11-10 03:57:32,275 INFO L605 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-10 03:57:32,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-11-10 03:57:32,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 648. [2018-11-10 03:57:32,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-11-10 03:57:32,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1080 transitions. [2018-11-10 03:57:32,291 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1080 transitions. Word has length 100 [2018-11-10 03:57:32,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:32,291 INFO L481 AbstractCegarLoop]: Abstraction has 648 states and 1080 transitions. [2018-11-10 03:57:32,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:57:32,291 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1080 transitions. [2018-11-10 03:57:32,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 03:57:32,293 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:32,293 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:57:32,293 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:32,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:32,294 INFO L82 PathProgramCache]: Analyzing trace with hash -692148403, now seen corresponding path program 1 times [2018-11-10 03:57:32,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:32,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:32,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:32,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:32,295 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:32,368 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:57:32,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:32,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:57:32,368 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:32,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:57:32,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:57:32,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:32,369 INFO L87 Difference]: Start difference. First operand 648 states and 1080 transitions. Second operand 4 states. [2018-11-10 03:57:32,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:32,725 INFO L93 Difference]: Finished difference Result 1521 states and 2501 transitions. [2018-11-10 03:57:32,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:57:32,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-11-10 03:57:32,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:32,728 INFO L225 Difference]: With dead ends: 1521 [2018-11-10 03:57:32,729 INFO L226 Difference]: Without dead ends: 899 [2018-11-10 03:57:32,730 INFO L605 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-10 03:57:32,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2018-11-10 03:57:32,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 724. [2018-11-10 03:57:32,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-11-10 03:57:32,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1214 transitions. [2018-11-10 03:57:32,748 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1214 transitions. Word has length 100 [2018-11-10 03:57:32,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:32,748 INFO L481 AbstractCegarLoop]: Abstraction has 724 states and 1214 transitions. [2018-11-10 03:57:32,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:57:32,748 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1214 transitions. [2018-11-10 03:57:32,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-10 03:57:32,750 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:32,750 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:57:32,750 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:32,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:32,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1553143090, now seen corresponding path program 1 times [2018-11-10 03:57:32,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:32,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:32,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:32,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:32,751 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:32,820 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:57:32,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:32,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:57:32,821 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:32,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:57:32,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:57:32,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:32,822 INFO L87 Difference]: Start difference. First operand 724 states and 1214 transitions. Second operand 4 states. [2018-11-10 03:57:33,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:33,218 INFO L93 Difference]: Finished difference Result 1591 states and 2623 transitions. [2018-11-10 03:57:33,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:57:33,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-11-10 03:57:33,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:33,222 INFO L225 Difference]: With dead ends: 1591 [2018-11-10 03:57:33,222 INFO L226 Difference]: Without dead ends: 893 [2018-11-10 03:57:33,223 INFO L605 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-10 03:57:33,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2018-11-10 03:57:33,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 724. [2018-11-10 03:57:33,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-11-10 03:57:33,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1210 transitions. [2018-11-10 03:57:33,242 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1210 transitions. Word has length 101 [2018-11-10 03:57:33,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:33,243 INFO L481 AbstractCegarLoop]: Abstraction has 724 states and 1210 transitions. [2018-11-10 03:57:33,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:57:33,243 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1210 transitions. [2018-11-10 03:57:33,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 03:57:33,244 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:33,245 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:57:33,245 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:33,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:33,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1654819470, now seen corresponding path program 1 times [2018-11-10 03:57:33,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:33,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:33,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:33,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:33,248 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:33,315 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-10 03:57:33,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:33,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:57:33,315 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:33,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:57:33,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:57:33,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:33,316 INFO L87 Difference]: Start difference. First operand 724 states and 1210 transitions. Second operand 4 states. [2018-11-10 03:57:33,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:33,634 INFO L93 Difference]: Finished difference Result 1436 states and 2402 transitions. [2018-11-10 03:57:33,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:57:33,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-11-10 03:57:33,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:33,637 INFO L225 Difference]: With dead ends: 1436 [2018-11-10 03:57:33,637 INFO L226 Difference]: Without dead ends: 738 [2018-11-10 03:57:33,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10 03:57:33,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-11-10 03:57:33,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 724. [2018-11-10 03:57:33,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-11-10 03:57:33,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1209 transitions. [2018-11-10 03:57:33,657 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1209 transitions. Word has length 108 [2018-11-10 03:57:33,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:33,657 INFO L481 AbstractCegarLoop]: Abstraction has 724 states and 1209 transitions. [2018-11-10 03:57:33,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:57:33,657 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1209 transitions. [2018-11-10 03:57:33,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 03:57:33,660 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:33,660 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:57:33,660 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:33,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:33,660 INFO L82 PathProgramCache]: Analyzing trace with hash -927934174, now seen corresponding path program 1 times [2018-11-10 03:57:33,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:33,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:33,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:33,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:33,661 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:33,764 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-10 03:57:33,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:33,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:57:33,765 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:33,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 03:57:33,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:57:33,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:57:33,766 INFO L87 Difference]: Start difference. First operand 724 states and 1209 transitions. Second operand 5 states. [2018-11-10 03:57:34,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:34,197 INFO L93 Difference]: Finished difference Result 1442 states and 2410 transitions. [2018-11-10 03:57:34,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 03:57:34,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2018-11-10 03:57:34,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:34,200 INFO L225 Difference]: With dead ends: 1442 [2018-11-10 03:57:34,200 INFO L226 Difference]: Without dead ends: 744 [2018-11-10 03:57:34,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 03:57:34,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-11-10 03:57:34,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 742. [2018-11-10 03:57:34,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2018-11-10 03:57:34,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1219 transitions. [2018-11-10 03:57:34,249 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1219 transitions. Word has length 108 [2018-11-10 03:57:34,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:34,249 INFO L481 AbstractCegarLoop]: Abstraction has 742 states and 1219 transitions. [2018-11-10 03:57:34,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 03:57:34,249 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1219 transitions. [2018-11-10 03:57:34,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 03:57:34,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:34,251 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:57:34,251 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:34,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:34,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1892658906, now seen corresponding path program 1 times [2018-11-10 03:57:34,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:34,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:34,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:34,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:34,253 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:34,317 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 03:57:34,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:34,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:57:34,317 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:34,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:57:34,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:57:34,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:34,318 INFO L87 Difference]: Start difference. First operand 742 states and 1219 transitions. Second operand 4 states. [2018-11-10 03:57:34,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:34,710 INFO L93 Difference]: Finished difference Result 1707 states and 2770 transitions. [2018-11-10 03:57:34,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:57:34,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-11-10 03:57:34,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:34,714 INFO L225 Difference]: With dead ends: 1707 [2018-11-10 03:57:34,714 INFO L226 Difference]: Without dead ends: 991 [2018-11-10 03:57:34,715 INFO L605 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-10 03:57:34,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2018-11-10 03:57:34,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 776. [2018-11-10 03:57:34,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2018-11-10 03:57:34,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1261 transitions. [2018-11-10 03:57:34,737 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1261 transitions. Word has length 108 [2018-11-10 03:57:34,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:34,738 INFO L481 AbstractCegarLoop]: Abstraction has 776 states and 1261 transitions. [2018-11-10 03:57:34,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:57:34,738 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1261 transitions. [2018-11-10 03:57:34,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 03:57:34,740 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:34,740 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:57:34,740 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:34,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:34,740 INFO L82 PathProgramCache]: Analyzing trace with hash 632335343, now seen corresponding path program 1 times [2018-11-10 03:57:34,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:34,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:34,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:34,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:34,741 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:34,811 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:57:34,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:34,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:57:34,812 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:34,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:57:34,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:57:34,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:34,812 INFO L87 Difference]: Start difference. First operand 776 states and 1261 transitions. Second operand 4 states. [2018-11-10 03:57:35,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:35,185 INFO L93 Difference]: Finished difference Result 1775 states and 2852 transitions. [2018-11-10 03:57:35,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:57:35,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2018-11-10 03:57:35,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:35,189 INFO L225 Difference]: With dead ends: 1775 [2018-11-10 03:57:35,189 INFO L226 Difference]: Without dead ends: 1025 [2018-11-10 03:57:35,190 INFO L605 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-10 03:57:35,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2018-11-10 03:57:35,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 864. [2018-11-10 03:57:35,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2018-11-10 03:57:35,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1409 transitions. [2018-11-10 03:57:35,216 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1409 transitions. Word has length 109 [2018-11-10 03:57:35,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:35,216 INFO L481 AbstractCegarLoop]: Abstraction has 864 states and 1409 transitions. [2018-11-10 03:57:35,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:57:35,216 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1409 transitions. [2018-11-10 03:57:35,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 03:57:35,218 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:35,218 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:57:35,218 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:35,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:35,219 INFO L82 PathProgramCache]: Analyzing trace with hash 457751074, now seen corresponding path program 1 times [2018-11-10 03:57:35,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:35,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:35,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:35,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:35,220 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:35,271 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 03:57:35,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:35,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:57:35,271 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:35,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:57:35,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:57:35,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:35,272 INFO L87 Difference]: Start difference. First operand 864 states and 1409 transitions. Second operand 4 states. [2018-11-10 03:57:35,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:35,665 INFO L93 Difference]: Finished difference Result 1869 states and 3010 transitions. [2018-11-10 03:57:35,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:57:35,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2018-11-10 03:57:35,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:35,670 INFO L225 Difference]: With dead ends: 1869 [2018-11-10 03:57:35,670 INFO L226 Difference]: Without dead ends: 1031 [2018-11-10 03:57:35,671 INFO L605 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-10 03:57:35,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2018-11-10 03:57:35,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 864. [2018-11-10 03:57:35,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2018-11-10 03:57:35,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1395 transitions. [2018-11-10 03:57:35,701 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1395 transitions. Word has length 109 [2018-11-10 03:57:35,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:35,701 INFO L481 AbstractCegarLoop]: Abstraction has 864 states and 1395 transitions. [2018-11-10 03:57:35,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:57:35,701 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1395 transitions. [2018-11-10 03:57:35,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 03:57:35,703 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:35,703 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:57:35,703 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:35,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:35,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1285320162, now seen corresponding path program 1 times [2018-11-10 03:57:35,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:35,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:35,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:35,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:35,705 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:35,792 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:57:35,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:35,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:57:35,793 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:35,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:57:35,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:57:35,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:35,794 INFO L87 Difference]: Start difference. First operand 864 states and 1395 transitions. Second operand 4 states. [2018-11-10 03:57:36,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:36,219 INFO L93 Difference]: Finished difference Result 1869 states and 2982 transitions. [2018-11-10 03:57:36,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:57:36,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-11-10 03:57:36,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:36,223 INFO L225 Difference]: With dead ends: 1869 [2018-11-10 03:57:36,223 INFO L226 Difference]: Without dead ends: 1027 [2018-11-10 03:57:36,225 INFO L605 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-10 03:57:36,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2018-11-10 03:57:36,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 868. [2018-11-10 03:57:36,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2018-11-10 03:57:36,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1401 transitions. [2018-11-10 03:57:36,247 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1401 transitions. Word has length 110 [2018-11-10 03:57:36,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:36,248 INFO L481 AbstractCegarLoop]: Abstraction has 868 states and 1401 transitions. [2018-11-10 03:57:36,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:57:36,248 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1401 transitions. [2018-11-10 03:57:36,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 03:57:36,249 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:36,250 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:57:36,250 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:36,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:36,250 INFO L82 PathProgramCache]: Analyzing trace with hash -247266505, now seen corresponding path program 1 times [2018-11-10 03:57:36,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:36,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:36,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:36,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:36,251 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:36,336 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 03:57:36,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:36,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:57:36,336 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:36,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:57:36,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:57:36,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:36,337 INFO L87 Difference]: Start difference. First operand 868 states and 1401 transitions. Second operand 4 states. [2018-11-10 03:57:36,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:36,624 INFO L93 Difference]: Finished difference Result 1955 states and 3122 transitions. [2018-11-10 03:57:36,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:57:36,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2018-11-10 03:57:36,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:36,627 INFO L225 Difference]: With dead ends: 1955 [2018-11-10 03:57:36,627 INFO L226 Difference]: Without dead ends: 1113 [2018-11-10 03:57:36,628 INFO L605 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-10 03:57:36,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2018-11-10 03:57:36,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 930. [2018-11-10 03:57:36,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2018-11-10 03:57:36,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1493 transitions. [2018-11-10 03:57:36,646 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1493 transitions. Word has length 122 [2018-11-10 03:57:36,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:36,646 INFO L481 AbstractCegarLoop]: Abstraction has 930 states and 1493 transitions. [2018-11-10 03:57:36,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:57:36,646 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1493 transitions. [2018-11-10 03:57:36,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 03:57:36,648 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:36,648 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:57:36,648 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:36,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:36,648 INFO L82 PathProgramCache]: Analyzing trace with hash -763639777, now seen corresponding path program 1 times [2018-11-10 03:57:36,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:36,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:36,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:36,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:36,650 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:36,695 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 03:57:36,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:36,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:57:36,695 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:36,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:57:36,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:57:36,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:36,696 INFO L87 Difference]: Start difference. First operand 930 states and 1493 transitions. Second operand 4 states. [2018-11-10 03:57:37,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:37,141 INFO L93 Difference]: Finished difference Result 1993 states and 3164 transitions. [2018-11-10 03:57:37,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:57:37,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-11-10 03:57:37,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:37,144 INFO L225 Difference]: With dead ends: 1993 [2018-11-10 03:57:37,144 INFO L226 Difference]: Without dead ends: 1089 [2018-11-10 03:57:37,145 INFO L605 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-10 03:57:37,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2018-11-10 03:57:37,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 930. [2018-11-10 03:57:37,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2018-11-10 03:57:37,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1479 transitions. [2018-11-10 03:57:37,164 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1479 transitions. Word has length 123 [2018-11-10 03:57:37,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:37,164 INFO L481 AbstractCegarLoop]: Abstraction has 930 states and 1479 transitions. [2018-11-10 03:57:37,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:57:37,165 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1479 transitions. [2018-11-10 03:57:37,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-10 03:57:37,166 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:37,166 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:57:37,167 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:37,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:37,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1064874668, now seen corresponding path program 1 times [2018-11-10 03:57:37,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:37,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:37,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:37,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:37,168 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:37,211 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 03:57:37,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:37,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:57:37,211 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:37,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:57:37,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:57:37,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:37,212 INFO L87 Difference]: Start difference. First operand 930 states and 1479 transitions. Second operand 4 states. [2018-11-10 03:57:37,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:37,596 INFO L93 Difference]: Finished difference Result 2079 states and 3274 transitions. [2018-11-10 03:57:37,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:57:37,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2018-11-10 03:57:37,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:37,600 INFO L225 Difference]: With dead ends: 2079 [2018-11-10 03:57:37,600 INFO L226 Difference]: Without dead ends: 1175 [2018-11-10 03:57:37,603 INFO L605 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-10 03:57:37,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2018-11-10 03:57:37,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 988. [2018-11-10 03:57:37,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-11-10 03:57:37,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1561 transitions. [2018-11-10 03:57:37,634 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1561 transitions. Word has length 126 [2018-11-10 03:57:37,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:37,634 INFO L481 AbstractCegarLoop]: Abstraction has 988 states and 1561 transitions. [2018-11-10 03:57:37,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:57:37,634 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1561 transitions. [2018-11-10 03:57:37,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 03:57:37,636 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:37,637 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:57:37,637 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:37,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:37,637 INFO L82 PathProgramCache]: Analyzing trace with hash -838401316, now seen corresponding path program 1 times [2018-11-10 03:57:37,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:37,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:37,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:37,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:37,638 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:37,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:37,698 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 03:57:37,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:37,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:57:37,699 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:37,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:57:37,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:57:37,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:37,699 INFO L87 Difference]: Start difference. First operand 988 states and 1561 transitions. Second operand 4 states. [2018-11-10 03:57:38,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:38,021 INFO L93 Difference]: Finished difference Result 2109 states and 3300 transitions. [2018-11-10 03:57:38,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:57:38,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-11-10 03:57:38,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:38,024 INFO L225 Difference]: With dead ends: 2109 [2018-11-10 03:57:38,024 INFO L226 Difference]: Without dead ends: 1147 [2018-11-10 03:57:38,026 INFO L605 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-10 03:57:38,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2018-11-10 03:57:38,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 988. [2018-11-10 03:57:38,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-11-10 03:57:38,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1545 transitions. [2018-11-10 03:57:38,049 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1545 transitions. Word has length 127 [2018-11-10 03:57:38,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:38,049 INFO L481 AbstractCegarLoop]: Abstraction has 988 states and 1545 transitions. [2018-11-10 03:57:38,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:57:38,049 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1545 transitions. [2018-11-10 03:57:38,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-10 03:57:38,051 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:38,052 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:57:38,052 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:38,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:38,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1452075573, now seen corresponding path program 1 times [2018-11-10 03:57:38,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:38,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:38,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:38,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:38,053 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:38,111 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 03:57:38,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:38,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:57:38,112 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:38,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:57:38,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:57:38,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:38,113 INFO L87 Difference]: Start difference. First operand 988 states and 1545 transitions. Second operand 4 states. [2018-11-10 03:57:38,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:38,407 INFO L93 Difference]: Finished difference Result 2195 states and 3402 transitions. [2018-11-10 03:57:38,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:57:38,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2018-11-10 03:57:38,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:38,410 INFO L225 Difference]: With dead ends: 2195 [2018-11-10 03:57:38,411 INFO L226 Difference]: Without dead ends: 1233 [2018-11-10 03:57:38,412 INFO L605 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-10 03:57:38,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-11-10 03:57:38,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1060. [2018-11-10 03:57:38,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2018-11-10 03:57:38,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1653 transitions. [2018-11-10 03:57:38,444 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1653 transitions. Word has length 134 [2018-11-10 03:57:38,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:38,444 INFO L481 AbstractCegarLoop]: Abstraction has 1060 states and 1653 transitions. [2018-11-10 03:57:38,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:57:38,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1653 transitions. [2018-11-10 03:57:38,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-10 03:57:38,447 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:38,447 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:57:38,447 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:38,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:38,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1504969438, now seen corresponding path program 1 times [2018-11-10 03:57:38,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:38,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:38,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:38,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:38,448 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:38,522 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 03:57:38,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:38,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:57:38,523 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:38,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:57:38,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:57:38,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:38,523 INFO L87 Difference]: Start difference. First operand 1060 states and 1653 transitions. Second operand 4 states. [2018-11-10 03:57:38,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:38,906 INFO L93 Difference]: Finished difference Result 2253 states and 3484 transitions. [2018-11-10 03:57:38,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:57:38,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2018-11-10 03:57:38,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:38,910 INFO L225 Difference]: With dead ends: 2253 [2018-11-10 03:57:38,910 INFO L226 Difference]: Without dead ends: 1219 [2018-11-10 03:57:38,912 INFO L605 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-10 03:57:38,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-11-10 03:57:38,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1060. [2018-11-10 03:57:38,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2018-11-10 03:57:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1645 transitions. [2018-11-10 03:57:38,944 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1645 transitions. Word has length 135 [2018-11-10 03:57:38,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:38,944 INFO L481 AbstractCegarLoop]: Abstraction has 1060 states and 1645 transitions. [2018-11-10 03:57:38,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:57:38,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1645 transitions. [2018-11-10 03:57:38,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 03:57:38,947 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:38,947 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:57:38,947 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:38,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:38,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1800358016, now seen corresponding path program 1 times [2018-11-10 03:57:38,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:38,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:38,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:38,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:38,949 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:39,046 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 03:57:39,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:39,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:57:39,046 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:39,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:57:39,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:57:39,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:39,047 INFO L87 Difference]: Start difference. First operand 1060 states and 1645 transitions. Second operand 4 states. [2018-11-10 03:57:39,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:39,467 INFO L93 Difference]: Finished difference Result 2342 states and 3601 transitions. [2018-11-10 03:57:39,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:57:39,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-11-10 03:57:39,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:39,469 INFO L225 Difference]: With dead ends: 2342 [2018-11-10 03:57:39,469 INFO L226 Difference]: Without dead ends: 1308 [2018-11-10 03:57:39,470 INFO L605 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-10 03:57:39,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2018-11-10 03:57:39,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1147. [2018-11-10 03:57:39,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1147 states. [2018-11-10 03:57:39,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1772 transitions. [2018-11-10 03:57:39,494 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1772 transitions. Word has length 152 [2018-11-10 03:57:39,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:39,494 INFO L481 AbstractCegarLoop]: Abstraction has 1147 states and 1772 transitions. [2018-11-10 03:57:39,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:57:39,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1772 transitions. [2018-11-10 03:57:39,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-10 03:57:39,496 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:39,497 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:57:39,497 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:39,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:39,497 INFO L82 PathProgramCache]: Analyzing trace with hash 98777869, now seen corresponding path program 1 times [2018-11-10 03:57:39,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:39,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:39,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:39,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:39,498 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:39,579 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 03:57:39,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:39,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:57:39,580 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:39,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:57:39,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:57:39,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:39,581 INFO L87 Difference]: Start difference. First operand 1147 states and 1772 transitions. Second operand 4 states. [2018-11-10 03:57:39,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:39,832 INFO L93 Difference]: Finished difference Result 2427 states and 3722 transitions. [2018-11-10 03:57:39,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:57:39,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-11-10 03:57:39,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:39,835 INFO L225 Difference]: With dead ends: 2427 [2018-11-10 03:57:39,835 INFO L226 Difference]: Without dead ends: 1290 [2018-11-10 03:57:39,837 INFO L605 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-10 03:57:39,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-11-10 03:57:39,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1131. [2018-11-10 03:57:39,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1131 states. [2018-11-10 03:57:39,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1744 transitions. [2018-11-10 03:57:39,868 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1744 transitions. Word has length 153 [2018-11-10 03:57:39,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:39,868 INFO L481 AbstractCegarLoop]: Abstraction has 1131 states and 1744 transitions. [2018-11-10 03:57:39,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:57:39,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1744 transitions. [2018-11-10 03:57:39,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-10 03:57:39,869 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:39,869 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-10 03:57:39,870 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:39,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:39,870 INFO L82 PathProgramCache]: Analyzing trace with hash 852159294, now seen corresponding path program 1 times [2018-11-10 03:57:39,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:39,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:39,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:39,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:39,871 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:39,960 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-10 03:57:39,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:39,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:57:39,961 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:39,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:57:39,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:57:39,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:39,961 INFO L87 Difference]: Start difference. First operand 1131 states and 1744 transitions. Second operand 4 states. [2018-11-10 03:57:40,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:40,256 INFO L93 Difference]: Finished difference Result 2465 states and 3776 transitions. [2018-11-10 03:57:40,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:57:40,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-11-10 03:57:40,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:40,258 INFO L225 Difference]: With dead ends: 2465 [2018-11-10 03:57:40,258 INFO L226 Difference]: Without dead ends: 1360 [2018-11-10 03:57:40,259 INFO L605 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-10 03:57:40,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2018-11-10 03:57:40,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1185. [2018-11-10 03:57:40,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2018-11-10 03:57:40,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1812 transitions. [2018-11-10 03:57:40,282 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1812 transitions. Word has length 155 [2018-11-10 03:57:40,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:40,282 INFO L481 AbstractCegarLoop]: Abstraction has 1185 states and 1812 transitions. [2018-11-10 03:57:40,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:57:40,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1812 transitions. [2018-11-10 03:57:40,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-10 03:57:40,283 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:40,283 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-10 03:57:40,283 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:40,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:40,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1074902506, now seen corresponding path program 1 times [2018-11-10 03:57:40,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:40,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:40,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:40,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:40,285 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:40,335 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-10 03:57:40,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:40,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:57:40,335 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:40,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:57:40,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:57:40,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:40,336 INFO L87 Difference]: Start difference. First operand 1185 states and 1812 transitions. Second operand 4 states. [2018-11-10 03:57:40,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:40,675 INFO L93 Difference]: Finished difference Result 2503 states and 3802 transitions. [2018-11-10 03:57:40,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:57:40,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-11-10 03:57:40,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:40,679 INFO L225 Difference]: With dead ends: 2503 [2018-11-10 03:57:40,679 INFO L226 Difference]: Without dead ends: 1344 [2018-11-10 03:57:40,680 INFO L605 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-10 03:57:40,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2018-11-10 03:57:40,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1185. [2018-11-10 03:57:40,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2018-11-10 03:57:40,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1790 transitions. [2018-11-10 03:57:40,713 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1790 transitions. Word has length 156 [2018-11-10 03:57:40,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:40,713 INFO L481 AbstractCegarLoop]: Abstraction has 1185 states and 1790 transitions. [2018-11-10 03:57:40,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:57:40,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1790 transitions. [2018-11-10 03:57:40,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-10 03:57:40,714 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:40,714 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:57:40,714 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:40,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:40,715 INFO L82 PathProgramCache]: Analyzing trace with hash -618930505, now seen corresponding path program 1 times [2018-11-10 03:57:40,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:40,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:40,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:40,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:40,716 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:40,825 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-11-10 03:57:40,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:40,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:57:40,825 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:40,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:57:40,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:57:40,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:40,828 INFO L87 Difference]: Start difference. First operand 1185 states and 1790 transitions. Second operand 4 states. [2018-11-10 03:57:41,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:41,108 INFO L93 Difference]: Finished difference Result 2573 states and 3866 transitions. [2018-11-10 03:57:41,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:57:41,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2018-11-10 03:57:41,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:41,111 INFO L225 Difference]: With dead ends: 2573 [2018-11-10 03:57:41,111 INFO L226 Difference]: Without dead ends: 1414 [2018-11-10 03:57:41,113 INFO L605 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-10 03:57:41,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2018-11-10 03:57:41,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1253. [2018-11-10 03:57:41,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1253 states. [2018-11-10 03:57:41,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1884 transitions. [2018-11-10 03:57:41,147 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1884 transitions. Word has length 169 [2018-11-10 03:57:41,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:41,147 INFO L481 AbstractCegarLoop]: Abstraction has 1253 states and 1884 transitions. [2018-11-10 03:57:41,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:57:41,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1884 transitions. [2018-11-10 03:57:41,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-10 03:57:41,148 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:41,148 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:57:41,148 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:41,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:41,148 INFO L82 PathProgramCache]: Analyzing trace with hash 29223242, now seen corresponding path program 1 times [2018-11-10 03:57:41,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:41,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:41,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:41,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:41,149 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:41,211 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-11-10 03:57:41,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:41,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:57:41,211 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:41,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:57:41,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:57:41,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:41,212 INFO L87 Difference]: Start difference. First operand 1253 states and 1884 transitions. Second operand 4 states. [2018-11-10 03:57:41,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:41,608 INFO L93 Difference]: Finished difference Result 2639 states and 3946 transitions. [2018-11-10 03:57:41,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:57:41,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2018-11-10 03:57:41,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:41,611 INFO L225 Difference]: With dead ends: 2639 [2018-11-10 03:57:41,611 INFO L226 Difference]: Without dead ends: 1394 [2018-11-10 03:57:41,613 INFO L605 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-10 03:57:41,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2018-11-10 03:57:41,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1169. [2018-11-10 03:57:41,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1169 states. [2018-11-10 03:57:41,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1744 transitions. [2018-11-10 03:57:41,649 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1744 transitions. Word has length 170 [2018-11-10 03:57:41,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:41,650 INFO L481 AbstractCegarLoop]: Abstraction has 1169 states and 1744 transitions. [2018-11-10 03:57:41,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:57:41,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1744 transitions. [2018-11-10 03:57:41,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 03:57:41,651 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:41,651 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:57:41,651 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:41,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:41,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1063015321, now seen corresponding path program 1 times [2018-11-10 03:57:41,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:41,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:41,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:41,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:41,652 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:41,731 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-10 03:57:41,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:41,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:57:41,731 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:41,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:57:41,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:57:41,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:41,732 INFO L87 Difference]: Start difference. First operand 1169 states and 1744 transitions. Second operand 4 states. [2018-11-10 03:57:42,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:42,003 INFO L93 Difference]: Finished difference Result 2497 states and 3708 transitions. [2018-11-10 03:57:42,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:57:42,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2018-11-10 03:57:42,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:42,005 INFO L225 Difference]: With dead ends: 2497 [2018-11-10 03:57:42,005 INFO L226 Difference]: Without dead ends: 1354 [2018-11-10 03:57:42,006 INFO L605 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-10 03:57:42,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-11-10 03:57:42,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1192. [2018-11-10 03:57:42,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2018-11-10 03:57:42,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1757 transitions. [2018-11-10 03:57:42,032 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1757 transitions. Word has length 175 [2018-11-10 03:57:42,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:42,032 INFO L481 AbstractCegarLoop]: Abstraction has 1192 states and 1757 transitions. [2018-11-10 03:57:42,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:57:42,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1757 transitions. [2018-11-10 03:57:42,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-10 03:57:42,033 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:42,033 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:57:42,033 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:42,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:42,033 INFO L82 PathProgramCache]: Analyzing trace with hash -129182209, now seen corresponding path program 1 times [2018-11-10 03:57:42,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:42,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:42,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:42,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:42,034 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:42,104 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-10 03:57:42,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:42,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:57:42,104 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:42,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:57:42,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:57:42,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:42,105 INFO L87 Difference]: Start difference. First operand 1192 states and 1757 transitions. Second operand 4 states. [2018-11-10 03:57:42,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:42,514 INFO L93 Difference]: Finished difference Result 2513 states and 3687 transitions. [2018-11-10 03:57:42,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:57:42,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2018-11-10 03:57:42,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:42,516 INFO L225 Difference]: With dead ends: 2513 [2018-11-10 03:57:42,516 INFO L226 Difference]: Without dead ends: 1347 [2018-11-10 03:57:42,517 INFO L605 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-10 03:57:42,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2018-11-10 03:57:42,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1192. [2018-11-10 03:57:42,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2018-11-10 03:57:42,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1733 transitions. [2018-11-10 03:57:42,545 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1733 transitions. Word has length 176 [2018-11-10 03:57:42,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:42,545 INFO L481 AbstractCegarLoop]: Abstraction has 1192 states and 1733 transitions. [2018-11-10 03:57:42,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:57:42,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1733 transitions. [2018-11-10 03:57:42,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-10 03:57:42,546 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:42,547 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:57:42,547 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:42,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:42,547 INFO L82 PathProgramCache]: Analyzing trace with hash 2049732444, now seen corresponding path program 1 times [2018-11-10 03:57:42,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:42,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:42,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:42,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:42,548 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:42,610 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-10 03:57:42,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:42,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:57:42,610 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:42,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:57:42,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:57:42,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:57:42,611 INFO L87 Difference]: Start difference. First operand 1192 states and 1733 transitions. Second operand 3 states. [2018-11-10 03:57:42,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:42,694 INFO L93 Difference]: Finished difference Result 2384 states and 3486 transitions. [2018-11-10 03:57:42,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:57:42,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2018-11-10 03:57:42,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:42,697 INFO L225 Difference]: With dead ends: 2384 [2018-11-10 03:57:42,697 INFO L226 Difference]: Without dead ends: 1786 [2018-11-10 03:57:42,698 INFO L605 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-10 03:57:42,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2018-11-10 03:57:42,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1767. [2018-11-10 03:57:42,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2018-11-10 03:57:42,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2577 transitions. [2018-11-10 03:57:42,744 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2577 transitions. Word has length 176 [2018-11-10 03:57:42,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:42,744 INFO L481 AbstractCegarLoop]: Abstraction has 1767 states and 2577 transitions. [2018-11-10 03:57:42,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:57:42,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2577 transitions. [2018-11-10 03:57:42,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 03:57:42,746 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:42,747 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 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-10 03:57:42,747 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:42,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:42,747 INFO L82 PathProgramCache]: Analyzing trace with hash 494990891, now seen corresponding path program 1 times [2018-11-10 03:57:42,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:42,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:42,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:42,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:42,748 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:42,804 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-11-10 03:57:42,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:57:42,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:57:42,805 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:57:42,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:57:42,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:57:42,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:57:42,805 INFO L87 Difference]: Start difference. First operand 1767 states and 2577 transitions. Second operand 4 states. [2018-11-10 03:57:43,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:57:43,197 INFO L93 Difference]: Finished difference Result 3816 states and 5544 transitions. [2018-11-10 03:57:43,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:57:43,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2018-11-10 03:57:43,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:57:43,200 INFO L225 Difference]: With dead ends: 3816 [2018-11-10 03:57:43,200 INFO L226 Difference]: Without dead ends: 2075 [2018-11-10 03:57:43,202 INFO L605 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-10 03:57:43,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2018-11-10 03:57:43,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 1842. [2018-11-10 03:57:43,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1842 states. [2018-11-10 03:57:43,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2658 transitions. [2018-11-10 03:57:43,257 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2658 transitions. Word has length 178 [2018-11-10 03:57:43,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:57:43,257 INFO L481 AbstractCegarLoop]: Abstraction has 1842 states and 2658 transitions. [2018-11-10 03:57:43,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:57:43,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2658 transitions. [2018-11-10 03:57:43,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 03:57:43,259 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:57:43,259 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:57:43,259 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:57:43,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:57:43,260 INFO L82 PathProgramCache]: Analyzing trace with hash -208047317, now seen corresponding path program 1 times [2018-11-10 03:57:43,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:57:43,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:43,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:57:43,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:57:43,261 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:57:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:57:43,550 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 14 proven. 153 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 03:57:43,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:57:43,550 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:57:43,551 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 179 with the following transitions: [2018-11-10 03:57:43,552 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [37], [43], [45], [50], [55], [60], [65], [70], [75], [80], [85], [88], [90], [95], [100], [103], [105], [110], [115], [120], [125], [130], [135], [140], [145], [150], [155], [160], [165], [170], [175], [180], [185], [188], [190], [195], [198], [200], [205], [208], [279], [282], [290], [292], [295], [303], [306], [310], [515], [520], [525], [540], [545], [550], [555], [561], [566], [568], [573], [578], [584], [587], [591], [612], [646], [648], [660], [663], [664], [665], [667] [2018-11-10 03:57:43,598 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:57:43,598 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:57:44,073 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 03:58:19,590 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 03:58:19,591 INFO L272 AbstractInterpreter]: Visited 80 different actions 408 times. Merged at 66 different actions 313 times. Widened at 9 different actions 9 times. Found 18 fixpoints after 8 different actions. Largest state had 142 variables. [2018-11-10 03:58:19,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:58:19,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 03:58:19,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:58:19,601 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/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-10 03:58:19,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:58:19,608 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 03:58:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:58:19,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:58:19,921 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 5 treesize of output 1 [2018-11-10 03:58:19,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 03:58:19,935 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-10 03:58:19,939 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-10 03:58:19,939 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 03:58:19,942 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:58:19,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, 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 20 [2018-11-10 03:58:19,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 03:58:19,978 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:58:19,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 03:58:19,986 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:58:19,987 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:58:19,993 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:58:19,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 03:58:19,997 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 03:58:20,003 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:58:20,008 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:58:20,013 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:58:20,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:58:20,022 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:51, output treesize:23 [2018-11-10 03:58:20,122 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-10 03:58:20,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-11-10 03:58:20,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:58:20,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:58:20,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 34 [2018-11-10 03:58:20,184 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 23 treesize of output 22 [2018-11-10 03:58:20,184 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:58:20,199 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:58:20,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:58:20,209 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:45, output treesize:14 [2018-11-10 03:58:20,228 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-10 03:58:20,230 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-10 03:58:20,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:58:20,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:58:20,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:58:20,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-10 03:58:20,252 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 34 treesize of output 28 [2018-11-10 03:58:20,253 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 28 treesize of output 16 [2018-11-10 03:58:20,254 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 03:58:20,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 03:58:20,267 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-10 03:58:20,269 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-10 03:58:20,269 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:58:20,272 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:58:20,277 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-10 03:58:20,277 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:13 [2018-11-10 03:58:20,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-10 03:58:20,301 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:58:20,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 03:58:20,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:58:20,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:58:20,319 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-10 03:58:20,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:13 [2018-11-10 03:58:20,333 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-10 03:58:20,335 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-10 03:58:20,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:58:20,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:58:20,338 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-10 03:58:20,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-10 03:58:20,411 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 03:58:20,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:58:20,496 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 50 treesize of output 42 [2018-11-10 03:58:20,521 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-10 03:58:20,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:58:20,531 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 10 treesize of output 8 [2018-11-10 03:58:20,534 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-10 03:58:20,535 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:58:20,537 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:58:20,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:58:20,547 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-10 03:58:20,548 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:10 [2018-11-10 03:58:20,939 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 03:58:20,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 03:58:20,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2018-11-10 03:58:20,969 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 03:58:20,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 03:58:20,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 03:58:20,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-11-10 03:58:20,970 INFO L87 Difference]: Start difference. First operand 1842 states and 2658 transitions. Second operand 16 states. [2018-11-10 03:58:22,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:58:22,838 INFO L93 Difference]: Finished difference Result 3720 states and 5360 transitions. [2018-11-10 03:58:22,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 03:58:22,839 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 178 [2018-11-10 03:58:22,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:58:22,841 INFO L225 Difference]: With dead ends: 3720 [2018-11-10 03:58:22,841 INFO L226 Difference]: Without dead ends: 1904 [2018-11-10 03:58:22,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 347 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2018-11-10 03:58:22,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2018-11-10 03:58:22,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1638. [2018-11-10 03:58:22,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1638 states. [2018-11-10 03:58:22,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2364 transitions. [2018-11-10 03:58:22,898 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2364 transitions. Word has length 178 [2018-11-10 03:58:22,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:58:22,898 INFO L481 AbstractCegarLoop]: Abstraction has 1638 states and 2364 transitions. [2018-11-10 03:58:22,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 03:58:22,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2364 transitions. [2018-11-10 03:58:22,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 03:58:22,901 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:58:22,902 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 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-10 03:58:22,902 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:58:22,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:58:22,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1267837171, now seen corresponding path program 1 times [2018-11-10 03:58:22,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:58:22,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:22,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:58:22,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:22,903 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:58:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:58:22,973 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-11-10 03:58:22,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:58:22,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:58:22,974 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:58:22,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:58:22,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:58:22,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:58:22,975 INFO L87 Difference]: Start difference. First operand 1638 states and 2364 transitions. Second operand 4 states. [2018-11-10 03:58:23,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:58:23,296 INFO L93 Difference]: Finished difference Result 2929 states and 4216 transitions. [2018-11-10 03:58:23,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:58:23,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2018-11-10 03:58:23,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:58:23,299 INFO L225 Difference]: With dead ends: 2929 [2018-11-10 03:58:23,299 INFO L226 Difference]: Without dead ends: 1305 [2018-11-10 03:58:23,300 INFO L605 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-10 03:58:23,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2018-11-10 03:58:23,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1157. [2018-11-10 03:58:23,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2018-11-10 03:58:23,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1649 transitions. [2018-11-10 03:58:23,337 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1649 transitions. Word has length 179 [2018-11-10 03:58:23,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:58:23,337 INFO L481 AbstractCegarLoop]: Abstraction has 1157 states and 1649 transitions. [2018-11-10 03:58:23,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:58:23,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1649 transitions. [2018-11-10 03:58:23,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-10 03:58:23,339 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:58:23,339 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:58:23,339 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:58:23,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:58:23,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1096033176, now seen corresponding path program 1 times [2018-11-10 03:58:23,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:58:23,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:23,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:58:23,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:58:23,340 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:58:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:58:23,503 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 192 proven. 28 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 03:58:23,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:58:23,504 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 03:58:23,504 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 205 with the following transitions: [2018-11-10 03:58:23,504 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [37], [43], [45], [50], [55], [60], [65], [70], [75], [80], [85], [88], [90], [95], [100], [103], [105], [110], [113], [115], [120], [123], [125], [130], [133], [135], [140], [145], [150], [153], [155], [160], [165], [170], [175], [180], [185], [188], [279], [282], [290], [292], [295], [303], [308], [310], [312], [315], [330], [332], [337], [339], [344], [349], [390], [392], [394], [397], [408], [410], [420], [422], [427], [433], [455], [457], [515], [520], [525], [612], [646], [648], [660], [663], [664], [665], [667] [2018-11-10 03:58:23,509 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 03:58:23,509 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 03:58:23,768 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 03:59:18,759 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 03:59:18,760 INFO L272 AbstractInterpreter]: Visited 86 different actions 610 times. Merged at 72 different actions 483 times. Widened at 13 different actions 37 times. Found 46 fixpoints after 20 different actions. Largest state had 153 variables. [2018-11-10 03:59:18,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:59:18,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 03:59:18,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:59:18,761 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/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-10 03:59:18,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:59:18,768 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 03:59:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:59:18,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:59:18,980 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 5 treesize of output 1 [2018-11-10 03:59:18,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:18,989 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 21 treesize of output 18 [2018-11-10 03:59:18,991 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-11-10 03:59:18,992 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:59:18,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 31 [2018-11-10 03:59:18,996 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:59:18,997 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:59:19,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 46 [2018-11-10 03:59:19,004 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-10 03:59:19,018 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 03:59:19,028 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 03:59:19,039 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 03:59:19,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:19,054 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:35, output treesize:10 [2018-11-10 03:59:19,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 78 [2018-11-10 03:59:19,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 03:59:19,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:19,099 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 77 treesize of output 53 [2018-11-10 03:59:19,101 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 22 treesize of output 21 [2018-11-10 03:59:19,101 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:19,111 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 42 treesize of output 47 [2018-11-10 03:59:19,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 03:59:19,131 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 03:59:19,144 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 03:59:19,154 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 03:59:19,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 03:59:19,179 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-10 03:59:19,179 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:118, output treesize:74 [2018-11-10 03:59:19,203 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 53 treesize of output 49 [2018-11-10 03:59:19,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2018-11-10 03:59:19,205 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 03:59:19,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 03:59:19,231 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 25 treesize of output 22 [2018-11-10 03:59:19,234 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 22 treesize of output 21 [2018-11-10 03:59:19,235 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:19,238 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:19,247 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 37 treesize of output 21 [2018-11-10 03:59:19,254 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 9 [2018-11-10 03:59:19,255 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:19,263 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:19,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:19,273 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:63, output treesize:20 [2018-11-10 03:59:19,287 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 10 treesize of output 8 [2018-11-10 03:59:19,292 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 8 treesize of output 4 [2018-11-10 03:59:19,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:19,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:19,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:19,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:9 [2018-11-10 03:59:19,306 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 15 [2018-11-10 03:59:19,307 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 3 [2018-11-10 03:59:19,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:19,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:19,310 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-10 03:59:19,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 03:59:19,370 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 100 proven. 120 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 03:59:19,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:59:19,402 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 125 treesize of output 119 [2018-11-10 03:59:19,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 107 [2018-11-10 03:59:19,406 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 03:59:19,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 03:59:19,428 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 107 treesize of output 79 [2018-11-10 03:59:19,430 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-10 03:59:19,430 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:19,435 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:59:19,438 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 78 treesize of output 59 [2018-11-10 03:59:19,455 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 03:59:19,461 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 26 treesize of output 42 [2018-11-10 03:59:19,461 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 03:59:19,473 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 33 treesize of output 17 [2018-11-10 03:59:19,474 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 03:59:19,474 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 03:59:19,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2018-11-10 03:59:19,475 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:19,476 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:19,477 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 17 [2018-11-10 03:59:19,479 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-10 03:59:19,479 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:19,480 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:19,484 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:19,487 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:19,491 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-10 03:59:19,491 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:125, output treesize:10 [2018-11-10 03:59:19,551 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 03:59:19,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 03:59:19,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 15 [2018-11-10 03:59:19,569 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 03:59:19,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 03:59:19,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 03:59:19,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-11-10 03:59:19,570 INFO L87 Difference]: Start difference. First operand 1157 states and 1649 transitions. Second operand 14 states. [2018-11-10 03:59:21,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:59:21,628 INFO L93 Difference]: Finished difference Result 6740 states and 9671 transitions. [2018-11-10 03:59:21,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 03:59:21,628 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 204 [2018-11-10 03:59:21,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:59:21,638 INFO L225 Difference]: With dead ends: 6740 [2018-11-10 03:59:21,638 INFO L226 Difference]: Without dead ends: 5644 [2018-11-10 03:59:21,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-11-10 03:59:21,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5644 states. [2018-11-10 03:59:21,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5644 to 2380. [2018-11-10 03:59:21,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2380 states. [2018-11-10 03:59:21,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 3491 transitions. [2018-11-10 03:59:21,784 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 3491 transitions. Word has length 204 [2018-11-10 03:59:21,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:59:21,785 INFO L481 AbstractCegarLoop]: Abstraction has 2380 states and 3491 transitions. [2018-11-10 03:59:21,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 03:59:21,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3491 transitions. [2018-11-10 03:59:21,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-11-10 03:59:21,788 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:59:21,788 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:59:21,788 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:59:21,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:59:21,788 INFO L82 PathProgramCache]: Analyzing trace with hash 2143906995, now seen corresponding path program 1 times [2018-11-10 03:59:21,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:59:21,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:59:21,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:59:21,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:59:21,789 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:59:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:59:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:59:22,077 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 03:59:22,096 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 03:59:22,097 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 03:59:22,097 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 03:59:22,098 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 03:59:22,098 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 03:59:22,098 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 03:59:22,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:59:22 BoogieIcfgContainer [2018-11-10 03:59:22,159 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 03:59:22,159 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:59:22,159 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:59:22,159 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:59:22,160 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:57:28" (3/4) ... [2018-11-10 03:59:22,166 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 03:59:22,166 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:59:22,166 INFO L168 Benchmark]: Toolchain (without parser) took 115571.53 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 950.0 MB in the beginning and 3.7 GB in the end (delta: -2.8 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-11-10 03:59:22,167 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:59:22,168 INFO L168 Benchmark]: CACSL2BoogieTranslator took 912.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.4 MB). Free memory was 950.0 MB in the beginning and 1.2 GB in the end (delta: -216.3 MB). Peak memory consumption was 174.4 MB. Max. memory is 11.5 GB. [2018-11-10 03:59:22,168 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. [2018-11-10 03:59:22,168 INFO L168 Benchmark]: Boogie Preprocessor took 75.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2018-11-10 03:59:22,168 INFO L168 Benchmark]: RCFGBuilder took 1010.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 983.5 MB in the end (delta: 159.7 MB). Peak memory consumption was 159.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:59:22,169 INFO L168 Benchmark]: TraceAbstraction took 113500.57 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 983.5 MB in the beginning and 3.7 GB in the end (delta: -2.8 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-11-10 03:59:22,169 INFO L168 Benchmark]: Witness Printer took 6.72 ms. Allocated memory is still 5.0 GB. Free memory is still 3.7 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:59:22,170 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 912.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.4 MB). Free memory was 950.0 MB in the beginning and 1.2 GB in the end (delta: -216.3 MB). Peak memory consumption was 174.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1010.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 983.5 MB in the end (delta: 159.7 MB). Peak memory consumption was 159.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 113500.57 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 983.5 MB in the beginning and 3.7 GB in the end (delta: -2.8 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 6.72 ms. Allocated memory is still 5.0 GB. Free memory is still 3.7 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1750]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] CALL static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1065] SSL *s ; [L1066] int tmp ; [L1070] EXPR, FCALL malloc(sizeof(SSL)) [L1070] s = malloc(sizeof(SSL)) [L1071] EXPR, FCALL malloc(sizeof(struct ssl3_state_st)) [L1071] CALL s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1071] RET s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] EXPR, FCALL malloc(sizeof(SSL_CTX)) [L1072] CALL s->ctx = malloc(sizeof(SSL_CTX)) [L1072] RET s->ctx = malloc(sizeof(SSL_CTX)) [L1073] EXPR, FCALL malloc(sizeof(SSL_SESSION)) [L1073] CALL s->session = malloc(sizeof(SSL_SESSION)) [L1073] RET s->session = malloc(sizeof(SSL_SESSION)) [L1074] CALL ssl3_accept(s) VAL [init=1, SSLv3_server_data={24587:0}] [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] CALL s->state = 8464 [L1105] RET s->state = 8464 [L1106] blastFlag = 0 [L1107] CALL s->hit=__VERIFIER_nondet_int () [L1107] RET s->hit=__VERIFIER_nondet_int () [L1108] CALL s->state = 8464 [L1108] RET s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] CALL, EXPR s->info_callback [L1115] RET, EXPR s->info_callback [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] CALL, EXPR s->info_callback [L1116] RET, EXPR s->info_callback [L1116] cb = s->info_callback [L1120] CALL, EXPR s->in_handshake [L1120] RET, EXPR s->in_handshake [L1120] CALL s->in_handshake += 1 [L1120] RET s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={24587:0}] [L1130] CALL, EXPR s->cert [L1130] RET, EXPR s->cert [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24587:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND TRUE s->state == 8464 [L1323] CALL s->shutdown = 0 [L1323] RET s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={24587:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] CALL s->state = 8496 [L1336] RET s->state = 8496 [L1337] CALL s->init_num = 0 [L1337] RET s->init_num = 0 [L1709] CALL, EXPR s->s3 [L1709] RET, EXPR s->s3 [L1709] CALL, EXPR (s->s3)->tmp.reuse_message [L1709] RET, EXPR (s->s3)->tmp.reuse_message [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [init=1, SSLv3_server_data={24587:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24587:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={24587:0}] [L1347] COND FALSE !(ret <= 0) [L1352] CALL s->hit [L1352] RET s->hit [L1352] COND TRUE s->hit [L1353] CALL s->state = 8656 [L1353] RET s->state = 8656 [L1357] CALL s->init_num = 0 [L1357] RET s->init_num = 0 [L1709] CALL, EXPR s->s3 [L1709] RET, EXPR s->s3 [L1709] CALL, EXPR (s->s3)->tmp.reuse_message [L1709] RET, EXPR (s->s3)->tmp.reuse_message [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [init=1, SSLv3_server_data={24587:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24587:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] CALL, EXPR s->state [L1205] RET, EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] CALL, EXPR s->state [L1208] RET, EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] CALL, EXPR s->state [L1211] RET, EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] CALL, EXPR s->state [L1214] RET, EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] CALL, EXPR s->state [L1217] RET, EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] CALL, EXPR s->state [L1220] RET, EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] CALL, EXPR s->state [L1223] RET, EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] CALL, EXPR s->state [L1226] RET, EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] CALL, EXPR s->state [L1229] RET, EXPR s->state [L1229] COND TRUE s->state == 8656 [L1594] CALL, EXPR s->session [L1594] RET, EXPR s->session [L1594] CALL, EXPR s->s3 [L1594] RET, EXPR s->s3 [L1594] CALL, EXPR (s->s3)->tmp.new_cipher [L1594] RET, EXPR (s->s3)->tmp.new_cipher [L1594] CALL (s->session)->cipher = (s->s3)->tmp.new_cipher [L1594] RET (s->session)->cipher = (s->s3)->tmp.new_cipher [L1595] COND FALSE !(! tmp___9) [L1601] ret = __VERIFIER_nondet_int() [L1602] COND FALSE !(blastFlag == 10) VAL [init=1, SSLv3_server_data={24587:0}] [L1605] COND FALSE !(blastFlag == 13) VAL [init=1, SSLv3_server_data={24587:0}] [L1611] COND FALSE !(ret <= 0) [L1616] CALL s->state = 8672 [L1616] RET s->state = 8672 [L1617] CALL s->init_num = 0 [L1617] RET s->init_num = 0 [L1618] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={24587:0}] [L1709] CALL, EXPR s->s3 [L1709] RET, EXPR s->s3 [L1709] CALL, EXPR (s->s3)->tmp.reuse_message [L1709] RET, EXPR (s->s3)->tmp.reuse_message [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [init=1, SSLv3_server_data={24587:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24587:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] CALL, EXPR s->state [L1205] RET, EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] CALL, EXPR s->state [L1208] RET, EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] CALL, EXPR s->state [L1211] RET, EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] CALL, EXPR s->state [L1214] RET, EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] CALL, EXPR s->state [L1217] RET, EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] CALL, EXPR s->state [L1220] RET, EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] CALL, EXPR s->state [L1223] RET, EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] CALL, EXPR s->state [L1226] RET, EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] CALL, EXPR s->state [L1229] RET, EXPR s->state [L1229] COND FALSE !(s->state == 8656) [L1232] CALL, EXPR s->state [L1232] RET, EXPR s->state [L1232] COND FALSE !(s->state == 8657) [L1235] CALL, EXPR s->state [L1235] RET, EXPR s->state [L1235] COND TRUE s->state == 8672 [L1627] ret = __VERIFIER_nondet_int() [L1628] COND FALSE !(blastFlag == 11) VAL [init=1, SSLv3_server_data={24587:0}] [L1631] COND FALSE !(blastFlag == 14) VAL [init=1, SSLv3_server_data={24587:0}] [L1637] COND FALSE !(ret <= 0) [L1642] CALL s->state = 8448 [L1642] RET s->state = 8448 [L1643] CALL s->hit [L1643] RET s->hit [L1643] COND TRUE s->hit [L1644] CALL, EXPR s->s3 [L1644] RET, EXPR s->s3 [L1644] CALL (s->s3)->tmp.next_state = 8640 [L1644] RET (s->s3)->tmp.next_state = 8640 [L1648] CALL s->init_num = 0 [L1648] RET s->init_num = 0 [L1709] CALL, EXPR s->s3 [L1709] RET, EXPR s->s3 [L1709] CALL, EXPR (s->s3)->tmp.reuse_message [L1709] RET, EXPR (s->s3)->tmp.reuse_message [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [init=1, SSLv3_server_data={24587:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24587:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={24587:0}] [L1503] CALL, EXPR s->s3 [L1503] RET, EXPR s->s3 [L1503] CALL, EXPR (s->s3)->tmp.next_state [L1503] RET, EXPR (s->s3)->tmp.next_state [L1503] CALL s->state = (s->s3)->tmp.next_state [L1503] RET s->state = (s->s3)->tmp.next_state [L1709] CALL, EXPR s->s3 [L1709] RET, EXPR s->s3 [L1709] CALL, EXPR (s->s3)->tmp.reuse_message [L1709] RET, EXPR (s->s3)->tmp.reuse_message [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [init=1, SSLv3_server_data={24587:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24587:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] CALL, EXPR s->state [L1205] RET, EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] CALL, EXPR s->state [L1208] RET, EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] CALL, EXPR s->state [L1211] RET, EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] CALL, EXPR s->state [L1214] RET, EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] CALL, EXPR s->state [L1217] RET, EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] CALL, EXPR s->state [L1220] RET, EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] CALL, EXPR s->state [L1223] RET, EXPR s->state [L1223] COND TRUE s->state == 8640 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND FALSE !(blastFlag == 9) VAL [init=1, SSLv3_server_data={24587:0}] [L1574] COND FALSE !(blastFlag == 12) VAL [init=1, SSLv3_server_data={24587:0}] [L1750] __VERIFIER_error() VAL [init=1, SSLv3_server_data={24587:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 1 error locations. UNSAFE Result, 113.4s OverallTime, 36 OverallIterations, 7 TraceHistogramMax, 15.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5541 SDtfs, 6792 SDslu, 12270 SDs, 0 SdLazy, 11164 SolverSat, 1794 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 973 GetRequests, 828 SyntacticMatches, 2 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2380occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 91.3s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 35 MinimizatonAttempts, 7735 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 5053 NumberOfCodeBlocks, 5053 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 5188 ConstructedInterpolants, 84 QuantifiedInterpolants, 4395190 SizeOfPredicates, 107 NumberOfNonLiveVariables, 4095 ConjunctsInSsa, 170 ConjunctsInUnsatCore, 39 InterpolantComputations, 33 PerfectInterpolantSequences, 4606/5461 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-11-10 03:59:23,710 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:59:23,712 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:59:23,720 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:59:23,720 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:59:23,721 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:59:23,722 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:59:23,723 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:59:23,724 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:59:23,725 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:59:23,725 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:59:23,725 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:59:23,727 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:59:23,727 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:59:23,728 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:59:23,729 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:59:23,729 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:59:23,731 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:59:23,732 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:59:23,733 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:59:23,734 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:59:23,735 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:59:23,737 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:59:23,737 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:59:23,737 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:59:23,739 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:59:23,739 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:59:23,740 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:59:23,741 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:59:23,741 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:59:23,741 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:59:23,743 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:59:23,743 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:59:23,743 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:59:23,744 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:59:23,744 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:59:23,745 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-10 03:59:23,756 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:59:23,756 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:59:23,757 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 03:59:23,757 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 03:59:23,757 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 03:59:23,757 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 03:59:23,757 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 03:59:23,757 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 03:59:23,758 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:59:23,759 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:59:23,759 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:59:23,759 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:59:23,759 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 03:59:23,759 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 03:59:23,759 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 03:59:23,760 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 03:59:23,760 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 03:59:23,760 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:59:23,760 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:59:23,760 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 03:59:23,760 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:59:23,760 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:59:23,760 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 03:59:23,761 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 03:59:23,761 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 03:59:23,761 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:59:23,761 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 03:59:23,761 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 03:59:23,761 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-10 03:59:23,761 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 03:59:23,762 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 03:59:23,762 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 03:59:23,762 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_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/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 -> d06f77684af1a50a152dd1d7247c10847b7d2ace [2018-11-10 03:59:23,797 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:59:23,806 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:59:23,809 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:59:23,811 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:59:23,811 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:59:23,812 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.14_false-unreach-call.i.cil.c [2018-11-10 03:59:23,858 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/data/bd2b815e5/f74f16f62c004cd5bfad12aa9ac8587c/FLAG0c8d979a8 [2018-11-10 03:59:24,249 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:59:24,250 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/sv-benchmarks/c/ssh/s3_srvr.blast.14_false-unreach-call.i.cil.c [2018-11-10 03:59:24,264 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/data/bd2b815e5/f74f16f62c004cd5bfad12aa9ac8587c/FLAG0c8d979a8 [2018-11-10 03:59:24,275 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/data/bd2b815e5/f74f16f62c004cd5bfad12aa9ac8587c [2018-11-10 03:59:24,278 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:59:24,279 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 03:59:24,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:59:24,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:59:24,283 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:59:24,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:59:24" (1/1) ... [2018-11-10 03:59:24,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cd86fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:59:24, skipping insertion in model container [2018-11-10 03:59:24,286 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:59:24" (1/1) ... [2018-11-10 03:59:24,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:59:24,338 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:59:24,852 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:59:24,864 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:59:25,084 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:59:25,099 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:59:25,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:59:25 WrapperNode [2018-11-10 03:59:25,100 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:59:25,101 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 03:59:25,101 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 03:59:25,101 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 03:59:25,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:59:25" (1/1) ... [2018-11-10 03:59:25,184 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:59:25" (1/1) ... [2018-11-10 03:59:25,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 03:59:25,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:59:25,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:59:25,232 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:59:25,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:59:25" (1/1) ... [2018-11-10 03:59:25,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:59:25" (1/1) ... [2018-11-10 03:59:25,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:59:25" (1/1) ... [2018-11-10 03:59:25,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:59:25" (1/1) ... [2018-11-10 03:59:25,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:59:25" (1/1) ... [2018-11-10 03:59:25,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:59:25" (1/1) ... [2018-11-10 03:59:25,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:59:25" (1/1) ... [2018-11-10 03:59:25,307 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:59:25,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:59:25,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:59:25,307 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:59:25,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:59:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/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-10 03:59:25,356 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 03:59:25,356 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 03:59:25,357 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-11-10 03:59:25,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-11-10 03:59:25,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 03:59:25,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 03:59:25,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:59:25,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:59:27,761 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 03:59:27,761 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 03:59:28,571 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:59:28,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:59:28 BoogieIcfgContainer [2018-11-10 03:59:28,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:59:28,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 03:59:28,573 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 03:59:28,575 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 03:59:28,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:59:24" (1/3) ... [2018-11-10 03:59:28,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c596020 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:59:28, skipping insertion in model container [2018-11-10 03:59:28,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:59:25" (2/3) ... [2018-11-10 03:59:28,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c596020 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:59:28, skipping insertion in model container [2018-11-10 03:59:28,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:59:28" (3/3) ... [2018-11-10 03:59:28,578 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.14_false-unreach-call.i.cil.c [2018-11-10 03:59:28,584 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 03:59:28,590 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 03:59:28,599 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 03:59:28,619 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:59:28,620 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 03:59:28,620 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 03:59:28,620 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 03:59:28,620 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:59:28,620 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:59:28,620 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 03:59:28,620 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:59:28,620 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 03:59:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states. [2018-11-10 03:59:28,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-10 03:59:28,642 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:59:28,642 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:59:28,644 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:59:28,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:59:28,648 INFO L82 PathProgramCache]: Analyzing trace with hash 283188315, now seen corresponding path program 1 times [2018-11-10 03:59:28,651 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:59:28,652 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/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-10 03:59:28,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:59:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:59:29,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:59:29,246 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-10 03:59:29,252 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-10 03:59:29,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:29,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:29,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:29,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 03:59:29,298 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 23 treesize of output 18 [2018-11-10 03:59:29,302 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:59:29,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 03:59:29,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:29,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:29,320 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-10 03:59:29,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 03:59:29,350 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-10 03:59:29,350 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:59:29,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:59:29,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 03:59:29,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 03:59:29,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 03:59:29,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:59:29,373 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 6 states. [2018-11-10 03:59:32,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:59:32,073 INFO L93 Difference]: Finished difference Result 346 states and 581 transitions. [2018-11-10 03:59:32,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 03:59:32,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-11-10 03:59:32,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:59:32,084 INFO L225 Difference]: With dead ends: 346 [2018-11-10 03:59:32,084 INFO L226 Difference]: Without dead ends: 176 [2018-11-10 03:59:32,087 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-10 03:59:32,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-11-10 03:59:32,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 159. [2018-11-10 03:59:32,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-10 03:59:32,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 244 transitions. [2018-11-10 03:59:32,124 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 244 transitions. Word has length 49 [2018-11-10 03:59:32,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:59:32,124 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 244 transitions. [2018-11-10 03:59:32,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 03:59:32,124 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 244 transitions. [2018-11-10 03:59:32,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 03:59:32,126 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:59:32,126 INFO L375 BasicCegarLoop]: trace histogram [2, 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, 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-10 03:59:32,127 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:59:32,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:59:32,127 INFO L82 PathProgramCache]: Analyzing trace with hash 564877000, now seen corresponding path program 1 times [2018-11-10 03:59:32,127 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:59:32,128 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/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-10 03:59:32,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:59:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:59:32,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:59:32,718 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-10 03:59:32,720 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-10 03:59:32,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:32,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:32,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:32,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 03:59:32,747 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 23 treesize of output 18 [2018-11-10 03:59:32,751 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:59:32,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 03:59:32,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:32,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:32,797 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-10 03:59:32,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 03:59:32,802 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 13 [2018-11-10 03:59:32,804 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-10 03:59:32,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:32,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:32,807 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-10 03:59:32,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 03:59:32,818 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:59:32,818 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-11-10 03:59:32,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:59:32,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 03:59:32,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 03:59:32,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 03:59:32,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:59:32,823 INFO L87 Difference]: Start difference. First operand 159 states and 244 transitions. Second operand 6 states. [2018-11-10 03:59:35,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:59:35,400 INFO L93 Difference]: Finished difference Result 309 states and 472 transitions. [2018-11-10 03:59:35,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 03:59:35,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-11-10 03:59:35,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:59:35,402 INFO L225 Difference]: With dead ends: 309 [2018-11-10 03:59:35,402 INFO L226 Difference]: Without dead ends: 176 [2018-11-10 03:59:35,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 03:59:35,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-11-10 03:59:35,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 159. [2018-11-10 03:59:35,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-10 03:59:35,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 243 transitions. [2018-11-10 03:59:35,413 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 243 transitions. Word has length 63 [2018-11-10 03:59:35,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:59:35,413 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 243 transitions. [2018-11-10 03:59:35,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 03:59:35,414 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 243 transitions. [2018-11-10 03:59:35,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-10 03:59:35,415 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:59:35,415 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:59:35,415 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:59:35,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:59:35,416 INFO L82 PathProgramCache]: Analyzing trace with hash -715240359, now seen corresponding path program 1 times [2018-11-10 03:59:35,416 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:59:35,416 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/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-10 03:59:35,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:59:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:59:35,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:59:35,798 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-10 03:59:35,800 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-10 03:59:35,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:35,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:35,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:35,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 03:59:35,816 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 15 [2018-11-10 03:59:35,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 15 treesize of output 3 [2018-11-10 03:59:35,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:35,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:35,823 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-10 03:59:35,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 03:59:35,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:59:35,841 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:59:35,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:59:35,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:59:35,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:59:35,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:59:35,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:59:35,845 INFO L87 Difference]: Start difference. First operand 159 states and 243 transitions. Second operand 4 states. [2018-11-10 03:59:38,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:59:38,262 INFO L93 Difference]: Finished difference Result 322 states and 494 transitions. [2018-11-10 03:59:38,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:59:38,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-11-10 03:59:38,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:59:38,263 INFO L225 Difference]: With dead ends: 322 [2018-11-10 03:59:38,263 INFO L226 Difference]: Without dead ends: 189 [2018-11-10 03:59:38,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 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-10 03:59:38,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-10 03:59:38,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 176. [2018-11-10 03:59:38,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-10 03:59:38,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 270 transitions. [2018-11-10 03:59:38,274 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 270 transitions. Word has length 64 [2018-11-10 03:59:38,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:59:38,274 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 270 transitions. [2018-11-10 03:59:38,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:59:38,274 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 270 transitions. [2018-11-10 03:59:38,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-10 03:59:38,276 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:59:38,276 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 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-10 03:59:38,276 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:59:38,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:59:38,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1940737371, now seen corresponding path program 1 times [2018-11-10 03:59:38,277 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:59:38,277 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/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-10 03:59:38,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:59:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:59:38,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:59:38,607 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-10 03:59:38,611 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-10 03:59:38,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:38,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:38,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:38,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 03:59:38,629 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 15 [2018-11-10 03:59:38,632 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 3 [2018-11-10 03:59:38,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:38,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:38,636 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-10 03:59:38,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 03:59:38,649 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:59:38,649 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:59:38,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:59:38,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:59:38,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:59:38,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:59:38,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:59:38,654 INFO L87 Difference]: Start difference. First operand 176 states and 270 transitions. Second operand 4 states. [2018-11-10 03:59:41,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:59:41,282 INFO L93 Difference]: Finished difference Result 441 states and 683 transitions. [2018-11-10 03:59:41,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:59:41,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-11-10 03:59:41,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:59:41,285 INFO L225 Difference]: With dead ends: 441 [2018-11-10 03:59:41,285 INFO L226 Difference]: Without dead ends: 291 [2018-11-10 03:59:41,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 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-10 03:59:41,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-11-10 03:59:41,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 217. [2018-11-10 03:59:41,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-10 03:59:41,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 344 transitions. [2018-11-10 03:59:41,299 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 344 transitions. Word has length 64 [2018-11-10 03:59:41,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:59:41,299 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 344 transitions. [2018-11-10 03:59:41,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:59:41,299 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 344 transitions. [2018-11-10 03:59:41,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-10 03:59:41,300 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:59:41,301 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 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, 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-10 03:59:41,301 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:59:41,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:59:41,301 INFO L82 PathProgramCache]: Analyzing trace with hash -2008297372, now seen corresponding path program 1 times [2018-11-10 03:59:41,302 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:59:41,302 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/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-10 03:59:41,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:59:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:59:41,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:59:41,854 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-10 03:59:41,856 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-10 03:59:41,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:41,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:41,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:41,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 03:59:41,881 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 23 treesize of output 18 [2018-11-10 03:59:41,884 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:59:41,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 03:59:41,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:41,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:41,898 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-10 03:59:41,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 03:59:41,902 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 13 [2018-11-10 03:59:41,903 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-10 03:59:41,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:41,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:41,906 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-10 03:59:41,906 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 03:59:41,915 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:59:41,916 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:59:41,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:59:41,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 03:59:41,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 03:59:41,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 03:59:41,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:59:41,919 INFO L87 Difference]: Start difference. First operand 217 states and 344 transitions. Second operand 6 states. [2018-11-10 03:59:44,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:59:44,499 INFO L93 Difference]: Finished difference Result 423 states and 671 transitions. [2018-11-10 03:59:44,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 03:59:44,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-11-10 03:59:44,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:59:44,500 INFO L225 Difference]: With dead ends: 423 [2018-11-10 03:59:44,501 INFO L226 Difference]: Without dead ends: 232 [2018-11-10 03:59:44,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 03:59:44,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-11-10 03:59:44,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 217. [2018-11-10 03:59:44,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-10 03:59:44,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 343 transitions. [2018-11-10 03:59:44,510 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 343 transitions. Word has length 64 [2018-11-10 03:59:44,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:59:44,510 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 343 transitions. [2018-11-10 03:59:44,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 03:59:44,511 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 343 transitions. [2018-11-10 03:59:44,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 03:59:44,511 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:59:44,511 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:59:44,512 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:59:44,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:59:44,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1947154439, now seen corresponding path program 1 times [2018-11-10 03:59:44,512 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:59:44,512 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 03:59:44,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:59:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:59:45,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:59:45,134 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-10 03:59:45,136 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-10 03:59:45,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:45,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:45,142 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-10 03:59:45,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-10 03:59:45,176 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 23 treesize of output 18 [2018-11-10 03:59:45,182 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:59:45,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 03:59:45,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:45,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:45,200 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-10 03:59:45,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 03:59:45,207 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 23 treesize of output 18 [2018-11-10 03:59:45,211 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:59:45,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 03:59:45,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:45,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:45,226 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-10 03:59:45,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 03:59:45,232 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 23 treesize of output 18 [2018-11-10 03:59:45,235 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:59:45,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 03:59:45,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:45,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:45,250 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-10 03:59:45,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 03:59:45,254 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-10 03:59:45,259 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-10 03:59:45,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:45,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:45,261 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-10 03:59:45,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:5 [2018-11-10 03:59:45,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:59:45,271 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:59:45,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:59:45,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 03:59:45,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 03:59:45,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 03:59:45,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 03:59:45,275 INFO L87 Difference]: Start difference. First operand 217 states and 343 transitions. Second operand 8 states. [2018-11-10 03:59:48,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:59:48,244 INFO L93 Difference]: Finished difference Result 417 states and 663 transitions. [2018-11-10 03:59:48,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 03:59:48,245 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-11-10 03:59:48,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:59:48,246 INFO L225 Difference]: With dead ends: 417 [2018-11-10 03:59:48,246 INFO L226 Difference]: Without dead ends: 226 [2018-11-10 03:59:48,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-10 03:59:48,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-10 03:59:48,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2018-11-10 03:59:48,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-11-10 03:59:48,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 354 transitions. [2018-11-10 03:59:48,254 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 354 transitions. Word has length 65 [2018-11-10 03:59:48,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:59:48,254 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 354 transitions. [2018-11-10 03:59:48,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 03:59:48,254 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 354 transitions. [2018-11-10 03:59:48,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 03:59:48,255 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:59:48,255 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:59:48,255 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:59:48,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:59:48,256 INFO L82 PathProgramCache]: Analyzing trace with hash 712277477, now seen corresponding path program 1 times [2018-11-10 03:59:48,256 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:59:48,256 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/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-10 03:59:48,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:59:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:59:48,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:59:48,854 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-10 03:59:48,855 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-10 03:59:48,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:48,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:48,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:48,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 03:59:48,879 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 23 treesize of output 18 [2018-11-10 03:59:48,881 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:59:48,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 03:59:48,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:48,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:48,898 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-10 03:59:48,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 03:59:48,902 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 15 [2018-11-10 03:59:48,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 15 treesize of output 3 [2018-11-10 03:59:48,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:48,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:48,908 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-10 03:59:48,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 03:59:48,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:59:48,917 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:59:48,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:59:48,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 03:59:48,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 03:59:48,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 03:59:48,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:59:48,920 INFO L87 Difference]: Start difference. First operand 226 states and 354 transitions. Second operand 6 states. [2018-11-10 03:59:51,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:59:51,508 INFO L93 Difference]: Finished difference Result 450 states and 703 transitions. [2018-11-10 03:59:51,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 03:59:51,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-11-10 03:59:51,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:59:51,509 INFO L225 Difference]: With dead ends: 450 [2018-11-10 03:59:51,509 INFO L226 Difference]: Without dead ends: 250 [2018-11-10 03:59:51,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 03:59:51,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-11-10 03:59:51,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 226. [2018-11-10 03:59:51,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-11-10 03:59:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 353 transitions. [2018-11-10 03:59:51,517 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 353 transitions. Word has length 65 [2018-11-10 03:59:51,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:59:51,517 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 353 transitions. [2018-11-10 03:59:51,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 03:59:51,517 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 353 transitions. [2018-11-10 03:59:51,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 03:59:51,517 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:59:51,518 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 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-10 03:59:51,518 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:59:51,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:59:51,518 INFO L82 PathProgramCache]: Analyzing trace with hash -273589102, now seen corresponding path program 1 times [2018-11-10 03:59:51,518 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:59:51,518 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 03:59:51,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:59:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:59:51,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:59:51,830 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-10 03:59:51,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 03:59:51,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:51,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:51,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:51,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 03:59:51,845 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 15 [2018-11-10 03:59:51,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 3 [2018-11-10 03:59:51,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:51,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:51,849 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-10 03:59:51,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 03:59:51,857 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:59:51,857 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:59:51,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:59:51,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:59:51,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:59:51,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:59:51,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:59:51,860 INFO L87 Difference]: Start difference. First operand 226 states and 353 transitions. Second operand 4 states. [2018-11-10 03:59:54,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:59:54,467 INFO L93 Difference]: Finished difference Result 502 states and 778 transitions. [2018-11-10 03:59:54,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:59:54,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-11-10 03:59:54,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:59:54,470 INFO L225 Difference]: With dead ends: 502 [2018-11-10 03:59:54,470 INFO L226 Difference]: Without dead ends: 302 [2018-11-10 03:59:54,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 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-10 03:59:54,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-11-10 03:59:54,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 227. [2018-11-10 03:59:54,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-10 03:59:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 354 transitions. [2018-11-10 03:59:54,480 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 354 transitions. Word has length 65 [2018-11-10 03:59:54,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:59:54,480 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 354 transitions. [2018-11-10 03:59:54,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:59:54,481 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 354 transitions. [2018-11-10 03:59:54,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 03:59:54,481 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:59:54,481 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:59:54,482 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:59:54,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:59:54,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1402822207, now seen corresponding path program 1 times [2018-11-10 03:59:54,482 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:59:54,482 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/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-10 03:59:54,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:59:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:59:55,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:59:55,119 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-10 03:59:55,120 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-10 03:59:55,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:55,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:55,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:55,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 03:59:55,145 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 23 treesize of output 18 [2018-11-10 03:59:55,148 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:59:55,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 03:59:55,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:55,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:55,175 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-10 03:59:55,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 03:59:55,179 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 15 [2018-11-10 03:59:55,183 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 3 [2018-11-10 03:59:55,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:55,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:55,189 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-10 03:59:55,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 03:59:55,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:59:55,205 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:59:55,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:59:55,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 03:59:55,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 03:59:55,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 03:59:55,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:59:55,209 INFO L87 Difference]: Start difference. First operand 227 states and 354 transitions. Second operand 6 states. [2018-11-10 03:59:57,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:59:57,880 INFO L93 Difference]: Finished difference Result 452 states and 704 transitions. [2018-11-10 03:59:57,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 03:59:57,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-10 03:59:57,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:59:57,882 INFO L225 Difference]: With dead ends: 452 [2018-11-10 03:59:57,882 INFO L226 Difference]: Without dead ends: 251 [2018-11-10 03:59:57,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 03:59:57,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-11-10 03:59:57,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 227. [2018-11-10 03:59:57,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-10 03:59:57,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 353 transitions. [2018-11-10 03:59:57,889 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 353 transitions. Word has length 66 [2018-11-10 03:59:57,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:59:57,890 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 353 transitions. [2018-11-10 03:59:57,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 03:59:57,890 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 353 transitions. [2018-11-10 03:59:57,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 03:59:57,890 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:59:57,890 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 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-10 03:59:57,891 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:59:57,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:59:57,891 INFO L82 PathProgramCache]: Analyzing trace with hash 2083404063, now seen corresponding path program 1 times [2018-11-10 03:59:57,891 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:59:57,891 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 03:59:57,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:59:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:59:58,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:59:58,512 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 18 treesize of output 15 [2018-11-10 03:59:58,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 03:59:58,519 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:59:58,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 03:59:58,522 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 03:59:58,528 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:58,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:59:58,542 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-10 03:59:58,542 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 03:59:58,577 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:59:58,577 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:59:58,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:59:58,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 03:59:58,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 03:59:58,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 03:59:58,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 03:59:58,581 INFO L87 Difference]: Start difference. First operand 227 states and 353 transitions. Second operand 7 states. [2018-11-10 04:00:01,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:00:01,521 INFO L93 Difference]: Finished difference Result 481 states and 751 transitions. [2018-11-10 04:00:01,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:00:01,522 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2018-11-10 04:00:01,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:00:01,522 INFO L225 Difference]: With dead ends: 481 [2018-11-10 04:00:01,523 INFO L226 Difference]: Without dead ends: 280 [2018-11-10 04:00:01,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:00:01,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-11-10 04:00:01,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 250. [2018-11-10 04:00:01,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-10 04:00:01,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 392 transitions. [2018-11-10 04:00:01,533 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 392 transitions. Word has length 67 [2018-11-10 04:00:01,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:00:01,534 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 392 transitions. [2018-11-10 04:00:01,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:00:01,534 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 392 transitions. [2018-11-10 04:00:01,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 04:00:01,535 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:00:01,535 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:00:01,535 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:00:01,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:00:01,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1993465152, now seen corresponding path program 1 times [2018-11-10 04:00:01,536 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:00:01,536 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/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-10 04:00:01,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:00:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:00:02,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:00:02,136 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-10 04:00:02,138 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-10 04:00:02,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:02,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:02,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:02,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:00:02,157 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 23 treesize of output 18 [2018-11-10 04:00:02,160 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:00:02,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:00:02,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:02,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:02,178 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-10 04:00:02,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:00:02,182 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 15 [2018-11-10 04:00:02,184 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 3 [2018-11-10 04:00:02,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:02,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:02,189 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-10 04:00:02,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 04:00:02,201 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:00:02,202 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:00:02,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:00:02,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 04:00:02,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 04:00:02,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 04:00:02,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:00:02,206 INFO L87 Difference]: Start difference. First operand 250 states and 392 transitions. Second operand 6 states. [2018-11-10 04:00:04,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:00:04,834 INFO L93 Difference]: Finished difference Result 498 states and 781 transitions. [2018-11-10 04:00:04,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:00:04,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-11-10 04:00:04,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:00:04,835 INFO L225 Difference]: With dead ends: 498 [2018-11-10 04:00:04,835 INFO L226 Difference]: Without dead ends: 274 [2018-11-10 04:00:04,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 04:00:04,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-11-10 04:00:04,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 250. [2018-11-10 04:00:04,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-10 04:00:04,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 391 transitions. [2018-11-10 04:00:04,847 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 391 transitions. Word has length 67 [2018-11-10 04:00:04,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:00:04,847 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 391 transitions. [2018-11-10 04:00:04,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 04:00:04,847 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 391 transitions. [2018-11-10 04:00:04,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-10 04:00:04,848 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:00:04,848 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:00:04,848 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:00:04,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:00:04,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1724377852, now seen corresponding path program 1 times [2018-11-10 04:00:04,849 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:00:04,849 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/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-10 04:00:04,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:00:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:00:05,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:00:05,485 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-10 04:00:05,487 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-10 04:00:05,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:05,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:05,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:05,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:00:05,508 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 23 treesize of output 18 [2018-11-10 04:00:05,511 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:00:05,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:00:05,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:05,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:05,532 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-10 04:00:05,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:00:05,534 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 15 [2018-11-10 04:00:05,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 15 treesize of output 3 [2018-11-10 04:00:05,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:05,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:05,549 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-10 04:00:05,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 04:00:05,560 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:00:05,560 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:00:05,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:00:05,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 04:00:05,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 04:00:05,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 04:00:05,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:00:05,566 INFO L87 Difference]: Start difference. First operand 250 states and 391 transitions. Second operand 6 states. [2018-11-10 04:00:08,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:00:08,187 INFO L93 Difference]: Finished difference Result 488 states and 767 transitions. [2018-11-10 04:00:08,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:00:08,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-10 04:00:08,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:00:08,188 INFO L225 Difference]: With dead ends: 488 [2018-11-10 04:00:08,188 INFO L226 Difference]: Without dead ends: 264 [2018-11-10 04:00:08,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 04:00:08,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-11-10 04:00:08,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 250. [2018-11-10 04:00:08,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-10 04:00:08,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 390 transitions. [2018-11-10 04:00:08,199 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 390 transitions. Word has length 68 [2018-11-10 04:00:08,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:00:08,199 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 390 transitions. [2018-11-10 04:00:08,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 04:00:08,199 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 390 transitions. [2018-11-10 04:00:08,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 04:00:08,200 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:00:08,200 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:00:08,200 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:00:08,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:00:08,201 INFO L82 PathProgramCache]: Analyzing trace with hash 933081670, now seen corresponding path program 1 times [2018-11-10 04:00:08,201 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:00:08,201 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/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-10 04:00:08,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:00:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:00:08,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:00:08,951 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-10 04:00:08,952 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-10 04:00:08,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:08,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:08,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:08,958 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:00:08,972 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 23 treesize of output 18 [2018-11-10 04:00:08,975 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:00:08,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:00:08,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:08,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:08,990 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-10 04:00:08,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:00:08,993 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 15 [2018-11-10 04:00:08,994 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 3 [2018-11-10 04:00:08,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:08,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:09,002 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-10 04:00:09,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 04:00:09,016 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:00:09,017 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:00:09,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:00:09,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 04:00:09,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 04:00:09,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 04:00:09,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:00:09,021 INFO L87 Difference]: Start difference. First operand 250 states and 390 transitions. Second operand 6 states. [2018-11-10 04:00:11,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:00:11,657 INFO L93 Difference]: Finished difference Result 478 states and 754 transitions. [2018-11-10 04:00:11,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:00:11,658 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-11-10 04:00:11,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:00:11,659 INFO L225 Difference]: With dead ends: 478 [2018-11-10 04:00:11,659 INFO L226 Difference]: Without dead ends: 254 [2018-11-10 04:00:11,659 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 04:00:11,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-10 04:00:11,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 250. [2018-11-10 04:00:11,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-10 04:00:11,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 389 transitions. [2018-11-10 04:00:11,666 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 389 transitions. Word has length 78 [2018-11-10 04:00:11,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:00:11,667 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 389 transitions. [2018-11-10 04:00:11,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 04:00:11,667 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 389 transitions. [2018-11-10 04:00:11,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 04:00:11,667 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:00:11,667 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:00:11,668 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:00:11,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:00:11,668 INFO L82 PathProgramCache]: Analyzing trace with hash -854908014, now seen corresponding path program 1 times [2018-11-10 04:00:11,668 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:00:11,668 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:00:11,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:00:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:00:12,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:00:12,071 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-10 04:00:12,073 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-10 04:00:12,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:12,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:12,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:12,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:00:12,083 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 15 [2018-11-10 04:00:12,085 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 3 [2018-11-10 04:00:12,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:12,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:12,087 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-10 04:00:12,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:00:12,095 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:00:12,095 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:00:12,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:00:12,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:00:12,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:00:12,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:00:12,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:00:12,098 INFO L87 Difference]: Start difference. First operand 250 states and 389 transitions. Second operand 4 states. [2018-11-10 04:00:14,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:00:14,695 INFO L93 Difference]: Finished difference Result 549 states and 852 transitions. [2018-11-10 04:00:14,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:00:14,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-11-10 04:00:14,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:00:14,696 INFO L225 Difference]: With dead ends: 549 [2018-11-10 04:00:14,696 INFO L226 Difference]: Without dead ends: 325 [2018-11-10 04:00:14,697 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 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-10 04:00:14,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-11-10 04:00:14,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 250. [2018-11-10 04:00:14,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-10 04:00:14,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 388 transitions. [2018-11-10 04:00:14,706 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 388 transitions. Word has length 78 [2018-11-10 04:00:14,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:00:14,706 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 388 transitions. [2018-11-10 04:00:14,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:00:14,707 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 388 transitions. [2018-11-10 04:00:14,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-10 04:00:14,707 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:00:14,707 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:00:14,708 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:00:14,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:00:14,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1223007450, now seen corresponding path program 1 times [2018-11-10 04:00:14,708 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:00:14,708 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/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-10 04:00:14,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:00:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:00:15,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:00:15,090 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-10 04:00:15,093 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-10 04:00:15,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:15,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:15,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:15,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:00:15,114 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 15 [2018-11-10 04:00:15,116 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 3 [2018-11-10 04:00:15,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:15,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:15,119 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-10 04:00:15,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:00:15,128 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:00:15,128 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:00:15,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:00:15,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:00:15,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:00:15,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:00:15,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:00:15,132 INFO L87 Difference]: Start difference. First operand 250 states and 388 transitions. Second operand 4 states. [2018-11-10 04:00:17,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:00:17,733 INFO L93 Difference]: Finished difference Result 547 states and 848 transitions. [2018-11-10 04:00:17,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:00:17,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-11-10 04:00:17,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:00:17,734 INFO L225 Difference]: With dead ends: 547 [2018-11-10 04:00:17,734 INFO L226 Difference]: Without dead ends: 323 [2018-11-10 04:00:17,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 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-10 04:00:17,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-11-10 04:00:17,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 250. [2018-11-10 04:00:17,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-10 04:00:17,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 387 transitions. [2018-11-10 04:00:17,746 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 387 transitions. Word has length 79 [2018-11-10 04:00:17,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:00:17,746 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 387 transitions. [2018-11-10 04:00:17,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:00:17,746 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 387 transitions. [2018-11-10 04:00:17,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 04:00:17,747 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:00:17,747 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:00:17,747 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:00:17,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:00:17,747 INFO L82 PathProgramCache]: Analyzing trace with hash 2098479151, now seen corresponding path program 1 times [2018-11-10 04:00:17,748 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:00:17,748 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:00:17,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:00:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:00:18,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:00:18,131 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-10 04:00:18,133 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-10 04:00:18,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:18,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:18,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:18,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:00:18,144 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 15 [2018-11-10 04:00:18,146 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 3 [2018-11-10 04:00:18,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:18,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:18,149 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-10 04:00:18,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:00:18,155 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:00:18,155 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:00:18,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:00:18,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:00:18,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:00:18,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:00:18,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:00:18,159 INFO L87 Difference]: Start difference. First operand 250 states and 387 transitions. Second operand 4 states. [2018-11-10 04:00:20,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:00:20,751 INFO L93 Difference]: Finished difference Result 547 states and 846 transitions. [2018-11-10 04:00:20,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:00:20,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-11-10 04:00:20,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:00:20,752 INFO L225 Difference]: With dead ends: 547 [2018-11-10 04:00:20,752 INFO L226 Difference]: Without dead ends: 323 [2018-11-10 04:00:20,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 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-10 04:00:20,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-11-10 04:00:20,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 250. [2018-11-10 04:00:20,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-10 04:00:20,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 386 transitions. [2018-11-10 04:00:20,759 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 386 transitions. Word has length 80 [2018-11-10 04:00:20,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:00:20,760 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 386 transitions. [2018-11-10 04:00:20,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:00:20,760 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 386 transitions. [2018-11-10 04:00:20,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 04:00:20,760 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:00:20,760 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:00:20,761 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:00:20,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:00:20,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1380243273, now seen corresponding path program 1 times [2018-11-10 04:00:20,761 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:00:20,761 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 18 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 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:00:20,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:00:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:00:21,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:00:21,150 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-10 04:00:21,152 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-10 04:00:21,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:21,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:21,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:21,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:00:21,164 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 15 [2018-11-10 04:00:21,166 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 3 [2018-11-10 04:00:21,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:21,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:21,172 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-10 04:00:21,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:00:21,180 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:00:21,180 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:00:21,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:00:21,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:00:21,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:00:21,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:00:21,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:00:21,184 INFO L87 Difference]: Start difference. First operand 250 states and 386 transitions. Second operand 4 states. [2018-11-10 04:00:23,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:00:23,775 INFO L93 Difference]: Finished difference Result 547 states and 844 transitions. [2018-11-10 04:00:23,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:00:23,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-11-10 04:00:23,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:00:23,776 INFO L225 Difference]: With dead ends: 547 [2018-11-10 04:00:23,777 INFO L226 Difference]: Without dead ends: 323 [2018-11-10 04:00:23,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 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-10 04:00:23,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-11-10 04:00:23,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 250. [2018-11-10 04:00:23,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-10 04:00:23,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 385 transitions. [2018-11-10 04:00:23,789 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 385 transitions. Word has length 81 [2018-11-10 04:00:23,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:00:23,789 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 385 transitions. [2018-11-10 04:00:23,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:00:23,789 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 385 transitions. [2018-11-10 04:00:23,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 04:00:23,790 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:00:23,790 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 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-10 04:00:23,790 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:00:23,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:00:23,790 INFO L82 PathProgramCache]: Analyzing trace with hash 232049804, now seen corresponding path program 1 times [2018-11-10 04:00:23,791 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:00:23,791 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:00:23,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:00:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:00:24,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:00:24,498 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 18 treesize of output 15 [2018-11-10 04:00:24,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 04:00:24,505 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:00:24,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:00:24,507 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:24,514 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:24,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:24,527 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-10 04:00:24,527 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:00:24,537 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 13 [2018-11-10 04:00:24,538 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-10 04:00:24,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:24,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:24,541 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-10 04:00:24,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:00:24,549 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:00:24,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:00:24,575 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 04:00:24,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:24,576 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-10 04:00:24,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 04:00:24,582 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:00:24,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:00:24,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 04:00:24,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 04:00:24,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 04:00:24,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 04:00:24,587 INFO L87 Difference]: Start difference. First operand 250 states and 385 transitions. Second operand 9 states. [2018-11-10 04:00:27,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:00:27,664 INFO L93 Difference]: Finished difference Result 641 states and 990 transitions. [2018-11-10 04:00:27,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 04:00:27,665 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2018-11-10 04:00:27,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:00:27,666 INFO L225 Difference]: With dead ends: 641 [2018-11-10 04:00:27,666 INFO L226 Difference]: Without dead ends: 417 [2018-11-10 04:00:27,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 04:00:27,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-11-10 04:00:27,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 267. [2018-11-10 04:00:27,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-11-10 04:00:27,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 411 transitions. [2018-11-10 04:00:27,675 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 411 transitions. Word has length 81 [2018-11-10 04:00:27,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:00:27,675 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 411 transitions. [2018-11-10 04:00:27,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 04:00:27,675 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 411 transitions. [2018-11-10 04:00:27,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 04:00:27,675 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:00:27,676 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:00:27,676 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:00:27,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:00:27,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1293518198, now seen corresponding path program 1 times [2018-11-10 04:00:27,676 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:00:27,676 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 20 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 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:00:27,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:00:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:00:28,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:00:28,073 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-10 04:00:28,075 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-10 04:00:28,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:28,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:28,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:28,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:00:28,089 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 15 [2018-11-10 04:00:28,091 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 3 [2018-11-10 04:00:28,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:28,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:28,092 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-10 04:00:28,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:00:28,099 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:00:28,099 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:00:28,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:00:28,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:00:28,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:00:28,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:00:28,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:00:28,102 INFO L87 Difference]: Start difference. First operand 267 states and 411 transitions. Second operand 4 states. [2018-11-10 04:00:30,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:00:30,731 INFO L93 Difference]: Finished difference Result 581 states and 894 transitions. [2018-11-10 04:00:30,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:00:30,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-11-10 04:00:30,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:00:30,732 INFO L225 Difference]: With dead ends: 581 [2018-11-10 04:00:30,732 INFO L226 Difference]: Without dead ends: 340 [2018-11-10 04:00:30,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 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-10 04:00:30,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-10 04:00:30,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 267. [2018-11-10 04:00:30,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-11-10 04:00:30,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 410 transitions. [2018-11-10 04:00:30,741 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 410 transitions. Word has length 82 [2018-11-10 04:00:30,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:00:30,741 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 410 transitions. [2018-11-10 04:00:30,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:00:30,741 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 410 transitions. [2018-11-10 04:00:30,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 04:00:30,742 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:00:30,742 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:00:30,742 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:00:30,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:00:30,742 INFO L82 PathProgramCache]: Analyzing trace with hash 558961440, now seen corresponding path program 1 times [2018-11-10 04:00:30,743 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:00:30,743 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 21 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 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:00:30,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:00:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:00:31,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:00:31,468 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 18 treesize of output 15 [2018-11-10 04:00:31,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 04:00:31,473 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:00:31,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:00:31,475 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:31,482 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:31,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:31,495 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-10 04:00:31,495 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:00:31,507 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 13 [2018-11-10 04:00:31,508 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-10 04:00:31,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:31,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:31,510 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-10 04:00:31,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:00:31,519 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 34 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:00:31,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:00:31,540 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 04:00:31,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:31,541 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-10 04:00:31,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 04:00:31,546 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:00:31,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:00:31,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 04:00:31,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 04:00:31,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 04:00:31,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 04:00:31,550 INFO L87 Difference]: Start difference. First operand 267 states and 410 transitions. Second operand 9 states. [2018-11-10 04:00:34,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:00:34,800 INFO L93 Difference]: Finished difference Result 656 states and 1010 transitions. [2018-11-10 04:00:34,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 04:00:34,800 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2018-11-10 04:00:34,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:00:34,801 INFO L225 Difference]: With dead ends: 656 [2018-11-10 04:00:34,801 INFO L226 Difference]: Without dead ends: 415 [2018-11-10 04:00:34,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 04:00:34,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-11-10 04:00:34,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 268. [2018-11-10 04:00:34,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-11-10 04:00:34,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 410 transitions. [2018-11-10 04:00:34,812 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 410 transitions. Word has length 82 [2018-11-10 04:00:34,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:00:34,812 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 410 transitions. [2018-11-10 04:00:34,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 04:00:34,812 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 410 transitions. [2018-11-10 04:00:34,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 04:00:34,813 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:00:34,813 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:00:34,813 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:00:34,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:00:34,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1947896946, now seen corresponding path program 1 times [2018-11-10 04:00:34,814 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:00:34,814 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 22 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 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:00:34,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:00:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:00:35,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:00:35,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 04:00:35,250 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-10 04:00:35,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:35,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:35,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:35,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:00:35,266 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 15 [2018-11-10 04:00:35,268 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 3 [2018-11-10 04:00:35,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:35,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:35,270 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-10 04:00:35,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:00:35,277 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:00:35,277 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:00:35,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:00:35,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:00:35,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:00:35,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:00:35,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:00:35,281 INFO L87 Difference]: Start difference. First operand 268 states and 410 transitions. Second operand 4 states. [2018-11-10 04:00:37,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:00:37,874 INFO L93 Difference]: Finished difference Result 573 states and 879 transitions. [2018-11-10 04:00:37,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:00:37,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-11-10 04:00:37,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:00:37,875 INFO L225 Difference]: With dead ends: 573 [2018-11-10 04:00:37,875 INFO L226 Difference]: Without dead ends: 331 [2018-11-10 04:00:37,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 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-10 04:00:37,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-11-10 04:00:37,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 268. [2018-11-10 04:00:37,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-11-10 04:00:37,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 409 transitions. [2018-11-10 04:00:37,885 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 409 transitions. Word has length 83 [2018-11-10 04:00:37,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:00:37,885 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 409 transitions. [2018-11-10 04:00:37,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:00:37,885 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 409 transitions. [2018-11-10 04:00:37,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 04:00:37,885 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:00:37,886 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:00:37,886 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:00:37,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:00:37,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1307077975, now seen corresponding path program 1 times [2018-11-10 04:00:37,886 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:00:37,887 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 23 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 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:00:37,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:00:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:00:38,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:00:38,643 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 18 treesize of output 15 [2018-11-10 04:00:38,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 04:00:38,648 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:00:38,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:00:38,650 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:38,658 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:38,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:38,670 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-10 04:00:38,670 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:00:38,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 19 treesize of output 15 [2018-11-10 04:00:38,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, 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 3 [2018-11-10 04:00:38,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:38,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:38,687 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-10 04:00:38,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 04:00:38,701 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:00:38,701 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:00:38,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:00:38,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:00:38,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:00:38,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:00:38,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:00:38,706 INFO L87 Difference]: Start difference. First operand 268 states and 409 transitions. Second operand 7 states. [2018-11-10 04:00:41,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:00:41,505 INFO L93 Difference]: Finished difference Result 538 states and 824 transitions. [2018-11-10 04:00:41,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:00:41,506 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-11-10 04:00:41,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:00:41,507 INFO L225 Difference]: With dead ends: 538 [2018-11-10 04:00:41,507 INFO L226 Difference]: Without dead ends: 296 [2018-11-10 04:00:41,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:00:41,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-11-10 04:00:41,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 268. [2018-11-10 04:00:41,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-11-10 04:00:41,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 408 transitions. [2018-11-10 04:00:41,516 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 408 transitions. Word has length 83 [2018-11-10 04:00:41,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:00:41,516 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 408 transitions. [2018-11-10 04:00:41,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:00:41,516 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 408 transitions. [2018-11-10 04:00:41,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 04:00:41,517 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:00:41,517 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:00:41,517 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:00:41,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:00:41,518 INFO L82 PathProgramCache]: Analyzing trace with hash 421668221, now seen corresponding path program 1 times [2018-11-10 04:00:41,518 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:00:41,518 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 24 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 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:00:41,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:00:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:00:42,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:00:42,267 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 18 treesize of output 15 [2018-11-10 04:00:42,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 04:00:42,273 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:00:42,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:00:42,275 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:42,281 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:42,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:42,298 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-10 04:00:42,298 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:00:42,311 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 15 [2018-11-10 04:00:42,312 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 3 [2018-11-10 04:00:42,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:42,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:42,317 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-10 04:00:42,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 04:00:42,330 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:00:42,330 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:00:42,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:00:42,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:00:42,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:00:42,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:00:42,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:00:42,334 INFO L87 Difference]: Start difference. First operand 268 states and 408 transitions. Second operand 7 states. [2018-11-10 04:00:45,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:00:45,135 INFO L93 Difference]: Finished difference Result 538 states and 822 transitions. [2018-11-10 04:00:45,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:00:45,135 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-11-10 04:00:45,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:00:45,136 INFO L225 Difference]: With dead ends: 538 [2018-11-10 04:00:45,136 INFO L226 Difference]: Without dead ends: 296 [2018-11-10 04:00:45,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:00:45,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-11-10 04:00:45,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 268. [2018-11-10 04:00:45,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-11-10 04:00:45,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 407 transitions. [2018-11-10 04:00:45,145 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 407 transitions. Word has length 84 [2018-11-10 04:00:45,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:00:45,145 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 407 transitions. [2018-11-10 04:00:45,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:00:45,145 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 407 transitions. [2018-11-10 04:00:45,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 04:00:45,146 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:00:45,146 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:00:45,146 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:00:45,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:00:45,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1268836732, now seen corresponding path program 1 times [2018-11-10 04:00:45,147 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:00:45,147 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 25 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 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:00:45,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:00:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:00:45,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:00:45,913 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 18 treesize of output 15 [2018-11-10 04:00:45,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 04:00:45,918 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:00:45,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:00:45,920 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:45,926 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:45,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:45,937 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-10 04:00:45,937 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:00:45,946 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 15 [2018-11-10 04:00:45,947 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 3 [2018-11-10 04:00:45,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:45,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:45,951 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-10 04:00:45,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 04:00:45,965 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:00:45,965 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:00:45,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:00:45,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:00:45,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:00:45,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:00:45,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:00:45,970 INFO L87 Difference]: Start difference. First operand 268 states and 407 transitions. Second operand 7 states. [2018-11-10 04:00:48,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:00:48,766 INFO L93 Difference]: Finished difference Result 538 states and 820 transitions. [2018-11-10 04:00:48,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:00:48,766 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-11-10 04:00:48,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:00:48,767 INFO L225 Difference]: With dead ends: 538 [2018-11-10 04:00:48,767 INFO L226 Difference]: Without dead ends: 296 [2018-11-10 04:00:48,768 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:00:48,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-11-10 04:00:48,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 268. [2018-11-10 04:00:48,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-11-10 04:00:48,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 406 transitions. [2018-11-10 04:00:48,782 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 406 transitions. Word has length 85 [2018-11-10 04:00:48,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:00:48,782 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 406 transitions. [2018-11-10 04:00:48,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:00:48,782 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 406 transitions. [2018-11-10 04:00:48,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 04:00:48,783 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:00:48,783 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:00:48,783 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:00:48,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:00:48,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1581944904, now seen corresponding path program 1 times [2018-11-10 04:00:48,784 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:00:48,784 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 26 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 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:00:48,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:00:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:00:49,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:00:49,602 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 18 treesize of output 15 [2018-11-10 04:00:49,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 04:00:49,607 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:00:49,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:00:49,609 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:49,615 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:49,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:49,626 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-10 04:00:49,626 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:00:49,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, 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 15 [2018-11-10 04:00:49,638 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 3 [2018-11-10 04:00:49,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:49,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:49,644 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-10 04:00:49,644 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 04:00:49,658 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:00:49,658 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:00:49,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:00:49,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:00:49,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:00:49,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:00:49,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:00:49,663 INFO L87 Difference]: Start difference. First operand 268 states and 406 transitions. Second operand 7 states. [2018-11-10 04:00:52,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:00:52,457 INFO L93 Difference]: Finished difference Result 528 states and 805 transitions. [2018-11-10 04:00:52,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:00:52,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2018-11-10 04:00:52,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:00:52,458 INFO L225 Difference]: With dead ends: 528 [2018-11-10 04:00:52,458 INFO L226 Difference]: Without dead ends: 286 [2018-11-10 04:00:52,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:00:52,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-11-10 04:00:52,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 268. [2018-11-10 04:00:52,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-11-10 04:00:52,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 405 transitions. [2018-11-10 04:00:52,467 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 405 transitions. Word has length 86 [2018-11-10 04:00:52,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:00:52,468 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 405 transitions. [2018-11-10 04:00:52,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:00:52,468 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 405 transitions. [2018-11-10 04:00:52,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 04:00:52,468 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:00:52,468 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 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-10 04:00:52,469 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:00:52,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:00:52,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1005910262, now seen corresponding path program 1 times [2018-11-10 04:00:52,469 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:00:52,469 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 27 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 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:00:52,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:00:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:00:52,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:00:52,592 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 04:00:52,592 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:00:52,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:00:52,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:00:52,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:00:52,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:00:52,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:00:52,595 INFO L87 Difference]: Start difference. First operand 268 states and 405 transitions. Second operand 3 states. [2018-11-10 04:00:52,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:00:52,649 INFO L93 Difference]: Finished difference Result 724 states and 1116 transitions. [2018-11-10 04:00:52,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:00:52,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-11-10 04:00:52,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:00:52,650 INFO L225 Difference]: With dead ends: 724 [2018-11-10 04:00:52,650 INFO L226 Difference]: Without dead ends: 482 [2018-11-10 04:00:52,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 85 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-10 04:00:52,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2018-11-10 04:00:52,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 480. [2018-11-10 04:00:52,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-11-10 04:00:52,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 725 transitions. [2018-11-10 04:00:52,687 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 725 transitions. Word has length 87 [2018-11-10 04:00:52,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:00:52,687 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 725 transitions. [2018-11-10 04:00:52,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:00:52,687 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 725 transitions. [2018-11-10 04:00:52,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 04:00:52,688 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:00:52,688 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 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-10 04:00:52,688 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:00:52,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:00:52,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1903303540, now seen corresponding path program 1 times [2018-11-10 04:00:52,689 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:00:52,689 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 28 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 28 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:00:52,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:00:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:00:53,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:00:53,089 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-10 04:00:53,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 04:00:53,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:53,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:53,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:53,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:00:53,101 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 15 [2018-11-10 04:00:53,102 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 3 [2018-11-10 04:00:53,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:53,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:53,105 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-10 04:00:53,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:00:53,112 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:00:53,112 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:00:53,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:00:53,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:00:53,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:00:53,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:00:53,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:00:53,115 INFO L87 Difference]: Start difference. First operand 480 states and 725 transitions. Second operand 4 states. [2018-11-10 04:00:55,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:00:55,722 INFO L93 Difference]: Finished difference Result 1059 states and 1586 transitions. [2018-11-10 04:00:55,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:00:55,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-11-10 04:00:55,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:00:55,724 INFO L225 Difference]: With dead ends: 1059 [2018-11-10 04:00:55,724 INFO L226 Difference]: Without dead ends: 605 [2018-11-10 04:00:55,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 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-10 04:00:55,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-11-10 04:00:55,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 480. [2018-11-10 04:00:55,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-11-10 04:00:55,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 723 transitions. [2018-11-10 04:00:55,741 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 723 transitions. Word has length 87 [2018-11-10 04:00:55,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:00:55,741 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 723 transitions. [2018-11-10 04:00:55,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:00:55,741 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 723 transitions. [2018-11-10 04:00:55,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 04:00:55,742 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:00:55,742 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:00:55,743 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:00:55,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:00:55,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1799100376, now seen corresponding path program 1 times [2018-11-10 04:00:55,743 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:00:55,743 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 29 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 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:00:55,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:00:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:00:56,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:00:56,147 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-10 04:00:56,150 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-10 04:00:56,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:56,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:56,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:56,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:00:56,165 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 15 [2018-11-10 04:00:56,167 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 3 [2018-11-10 04:00:56,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:56,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:56,169 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-10 04:00:56,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:00:56,177 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:00:56,177 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:00:56,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:00:56,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:00:56,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:00:56,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:00:56,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:00:56,181 INFO L87 Difference]: Start difference. First operand 480 states and 723 transitions. Second operand 4 states. [2018-11-10 04:00:58,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:00:58,823 INFO L93 Difference]: Finished difference Result 1059 states and 1582 transitions. [2018-11-10 04:00:58,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:00:58,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-11-10 04:00:58,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:00:58,825 INFO L225 Difference]: With dead ends: 1059 [2018-11-10 04:00:58,825 INFO L226 Difference]: Without dead ends: 605 [2018-11-10 04:00:58,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 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-10 04:00:58,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-11-10 04:00:58,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 480. [2018-11-10 04:00:58,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-11-10 04:00:58,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 721 transitions. [2018-11-10 04:00:58,855 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 721 transitions. Word has length 87 [2018-11-10 04:00:58,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:00:58,856 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 721 transitions. [2018-11-10 04:00:58,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:00:58,856 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 721 transitions. [2018-11-10 04:00:58,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-10 04:00:58,856 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:00:58,857 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:00:58,857 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:00:58,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:00:58,857 INFO L82 PathProgramCache]: Analyzing trace with hash -102427100, now seen corresponding path program 1 times [2018-11-10 04:00:58,857 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:00:58,857 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 30 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 30 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:00:58,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:00:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:00:59,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:00:59,281 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-10 04:00:59,284 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-10 04:00:59,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:59,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:59,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:59,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:00:59,297 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 15 [2018-11-10 04:00:59,299 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 3 [2018-11-10 04:00:59,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:00:59,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:00:59,301 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-10 04:00:59,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:00:59,308 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:00:59,308 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:00:59,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:00:59,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:00:59,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:00:59,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:00:59,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:00:59,311 INFO L87 Difference]: Start difference. First operand 480 states and 721 transitions. Second operand 4 states. [2018-11-10 04:01:01,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:01:01,901 INFO L93 Difference]: Finished difference Result 1051 states and 1567 transitions. [2018-11-10 04:01:01,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:01:01,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-11-10 04:01:01,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:01:01,902 INFO L225 Difference]: With dead ends: 1051 [2018-11-10 04:01:01,902 INFO L226 Difference]: Without dead ends: 597 [2018-11-10 04:01:01,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 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-10 04:01:01,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-11-10 04:01:01,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 480. [2018-11-10 04:01:01,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-11-10 04:01:01,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 719 transitions. [2018-11-10 04:01:01,926 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 719 transitions. Word has length 88 [2018-11-10 04:01:01,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:01:01,927 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 719 transitions. [2018-11-10 04:01:01,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:01:01,927 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 719 transitions. [2018-11-10 04:01:01,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-10 04:01:01,927 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:01:01,928 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:01:01,928 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:01:01,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:01,928 INFO L82 PathProgramCache]: Analyzing trace with hash 527991312, now seen corresponding path program 1 times [2018-11-10 04:01:01,928 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:01:01,929 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 31 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 31 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:01:01,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:01:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:02,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:02,347 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-10 04:01:02,349 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-10 04:01:02,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:02,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:02,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:02,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:01:02,360 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 15 [2018-11-10 04:01:02,361 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 3 [2018-11-10 04:01:02,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:02,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:02,363 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-10 04:01:02,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:01:02,371 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:02,371 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:01:02,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:01:02,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:01:02,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:01:02,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:01:02,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:01:02,375 INFO L87 Difference]: Start difference. First operand 480 states and 719 transitions. Second operand 4 states. [2018-11-10 04:01:04,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:01:04,970 INFO L93 Difference]: Finished difference Result 1041 states and 1550 transitions. [2018-11-10 04:01:04,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:01:04,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-11-10 04:01:04,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:01:04,972 INFO L225 Difference]: With dead ends: 1041 [2018-11-10 04:01:04,972 INFO L226 Difference]: Without dead ends: 587 [2018-11-10 04:01:04,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 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-10 04:01:04,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-11-10 04:01:04,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 480. [2018-11-10 04:01:04,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-11-10 04:01:04,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 717 transitions. [2018-11-10 04:01:04,994 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 717 transitions. Word has length 88 [2018-11-10 04:01:04,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:01:04,994 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 717 transitions. [2018-11-10 04:01:04,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:01:04,994 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 717 transitions. [2018-11-10 04:01:04,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-10 04:01:04,994 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:01:04,995 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:01:04,995 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:01:04,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:04,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1666332655, now seen corresponding path program 1 times [2018-11-10 04:01:04,995 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:01:04,996 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 32 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 32 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:01:05,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:01:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:05,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:05,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, 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-10 04:01:05,422 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-10 04:01:05,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:05,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:05,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:05,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:01:05,438 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 15 [2018-11-10 04:01:05,440 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 3 [2018-11-10 04:01:05,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:05,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:05,443 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-10 04:01:05,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:01:05,450 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:05,451 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:01:05,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:01:05,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:01:05,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:01:05,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:01:05,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:01:05,454 INFO L87 Difference]: Start difference. First operand 480 states and 717 transitions. Second operand 4 states. [2018-11-10 04:01:08,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:01:08,043 INFO L93 Difference]: Finished difference Result 1041 states and 1546 transitions. [2018-11-10 04:01:08,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:01:08,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-11-10 04:01:08,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:01:08,045 INFO L225 Difference]: With dead ends: 1041 [2018-11-10 04:01:08,045 INFO L226 Difference]: Without dead ends: 587 [2018-11-10 04:01:08,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 87 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-10 04:01:08,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-11-10 04:01:08,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 480. [2018-11-10 04:01:08,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-11-10 04:01:08,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 715 transitions. [2018-11-10 04:01:08,063 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 715 transitions. Word has length 90 [2018-11-10 04:01:08,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:01:08,063 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 715 transitions. [2018-11-10 04:01:08,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:01:08,063 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 715 transitions. [2018-11-10 04:01:08,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-10 04:01:08,064 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:01:08,064 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-10 04:01:08,064 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:01:08,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:08,064 INFO L82 PathProgramCache]: Analyzing trace with hash 391567184, now seen corresponding path program 1 times [2018-11-10 04:01:08,065 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:01:08,065 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 33 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 33 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:01:08,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:01:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:08,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:08,818 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-10 04:01:08,820 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-10 04:01:08,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:08,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:08,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:08,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:01:08,839 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 23 treesize of output 18 [2018-11-10 04:01:08,842 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:01:08,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:01:08,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:08,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:08,856 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-10 04:01:08,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:01:08,859 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 13 [2018-11-10 04:01:08,861 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-10 04:01:08,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:08,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:08,863 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-10 04:01:08,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:01:08,875 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:01:08,875 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:01:08,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:01:08,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:01:08,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:01:08,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:01:08,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:01:08,879 INFO L87 Difference]: Start difference. First operand 480 states and 715 transitions. Second operand 7 states. [2018-11-10 04:01:11,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:01:11,957 INFO L93 Difference]: Finished difference Result 964 states and 1442 transitions. [2018-11-10 04:01:11,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:01:11,958 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2018-11-10 04:01:11,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:01:11,959 INFO L225 Difference]: With dead ends: 964 [2018-11-10 04:01:11,960 INFO L226 Difference]: Without dead ends: 719 [2018-11-10 04:01:11,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:01:11,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-11-10 04:01:11,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 562. [2018-11-10 04:01:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2018-11-10 04:01:11,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 859 transitions. [2018-11-10 04:01:11,980 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 859 transitions. Word has length 90 [2018-11-10 04:01:11,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:01:11,980 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 859 transitions. [2018-11-10 04:01:11,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:01:11,980 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 859 transitions. [2018-11-10 04:01:11,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-10 04:01:11,981 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:01:11,981 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-10 04:01:11,981 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:01:11,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:11,981 INFO L82 PathProgramCache]: Analyzing trace with hash 815213906, now seen corresponding path program 1 times [2018-11-10 04:01:11,982 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:01:11,982 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 34 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 34 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:01:11,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:01:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:12,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:12,757 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-10 04:01:12,759 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-10 04:01:12,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:12,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:12,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:12,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:01:12,780 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 23 treesize of output 18 [2018-11-10 04:01:12,783 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:01:12,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:01:12,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:12,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:12,800 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-10 04:01:12,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:01:12,825 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:01:12,825 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:01:12,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:01:12,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:01:12,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:01:12,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:01:12,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:01:12,830 INFO L87 Difference]: Start difference. First operand 562 states and 859 transitions. Second operand 7 states. [2018-11-10 04:01:15,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:01:15,735 INFO L93 Difference]: Finished difference Result 1213 states and 1854 transitions. [2018-11-10 04:01:15,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:01:15,735 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2018-11-10 04:01:15,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:01:15,737 INFO L225 Difference]: With dead ends: 1213 [2018-11-10 04:01:15,737 INFO L226 Difference]: Without dead ends: 677 [2018-11-10 04:01:15,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:01:15,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2018-11-10 04:01:15,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 612. [2018-11-10 04:01:15,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-11-10 04:01:15,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 941 transitions. [2018-11-10 04:01:15,759 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 941 transitions. Word has length 90 [2018-11-10 04:01:15,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:01:15,759 INFO L481 AbstractCegarLoop]: Abstraction has 612 states and 941 transitions. [2018-11-10 04:01:15,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:01:15,759 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 941 transitions. [2018-11-10 04:01:15,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-10 04:01:15,760 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:01:15,760 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:01:15,760 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:01:15,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:15,760 INFO L82 PathProgramCache]: Analyzing trace with hash 417468791, now seen corresponding path program 1 times [2018-11-10 04:01:15,761 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:01:15,761 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 35 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 35 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:01:15,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:01:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:16,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:16,206 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-10 04:01:16,208 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-10 04:01:16,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:16,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:16,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:16,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:01:16,221 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 15 [2018-11-10 04:01:16,224 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 3 [2018-11-10 04:01:16,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:16,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:16,227 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-10 04:01:16,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:01:16,238 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:16,238 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:01:16,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:01:16,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:01:16,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:01:16,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:01:16,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:01:16,242 INFO L87 Difference]: Start difference. First operand 612 states and 941 transitions. Second operand 4 states. [2018-11-10 04:01:18,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:01:18,798 INFO L93 Difference]: Finished difference Result 1289 states and 1968 transitions. [2018-11-10 04:01:18,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:01:18,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-11-10 04:01:18,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:01:18,799 INFO L225 Difference]: With dead ends: 1289 [2018-11-10 04:01:18,799 INFO L226 Difference]: Without dead ends: 703 [2018-11-10 04:01:18,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 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-10 04:01:18,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2018-11-10 04:01:18,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 612. [2018-11-10 04:01:18,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-11-10 04:01:18,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 939 transitions. [2018-11-10 04:01:18,825 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 939 transitions. Word has length 91 [2018-11-10 04:01:18,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:01:18,825 INFO L481 AbstractCegarLoop]: Abstraction has 612 states and 939 transitions. [2018-11-10 04:01:18,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:01:18,825 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 939 transitions. [2018-11-10 04:01:18,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-10 04:01:18,825 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:01:18,825 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-10 04:01:18,826 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:01:18,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:18,826 INFO L82 PathProgramCache]: Analyzing trace with hash -986591929, now seen corresponding path program 1 times [2018-11-10 04:01:18,826 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:01:18,826 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 36 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 36 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:01:18,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:01:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:19,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:19,579 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-10 04:01:19,580 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-10 04:01:19,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:19,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:19,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:19,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:01:19,606 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 23 treesize of output 18 [2018-11-10 04:01:19,609 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:01:19,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:01:19,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:19,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:19,624 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-10 04:01:19,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:01:19,628 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 13 [2018-11-10 04:01:19,630 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-10 04:01:19,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:19,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:19,634 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-10 04:01:19,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:01:19,648 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:01:19,648 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:01:19,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:01:19,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:01:19,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:01:19,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:01:19,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:01:19,653 INFO L87 Difference]: Start difference. First operand 612 states and 939 transitions. Second operand 7 states. [2018-11-10 04:01:22,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:01:22,680 INFO L93 Difference]: Finished difference Result 1070 states and 1620 transitions. [2018-11-10 04:01:22,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:01:22,680 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-11-10 04:01:22,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:01:22,682 INFO L225 Difference]: With dead ends: 1070 [2018-11-10 04:01:22,682 INFO L226 Difference]: Without dead ends: 759 [2018-11-10 04:01:22,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:01:22,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-11-10 04:01:22,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 592. [2018-11-10 04:01:22,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-11-10 04:01:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 901 transitions. [2018-11-10 04:01:22,703 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 901 transitions. Word has length 91 [2018-11-10 04:01:22,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:01:22,703 INFO L481 AbstractCegarLoop]: Abstraction has 592 states and 901 transitions. [2018-11-10 04:01:22,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:01:22,703 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 901 transitions. [2018-11-10 04:01:22,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-10 04:01:22,704 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:01:22,704 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:01:22,704 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:01:22,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:22,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1419867985, now seen corresponding path program 1 times [2018-11-10 04:01:22,704 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:01:22,704 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 37 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 37 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:01:22,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:01:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:23,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:23,158 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-10 04:01:23,160 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-10 04:01:23,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:23,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:23,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:23,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:01:23,173 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 15 [2018-11-10 04:01:23,175 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 3 [2018-11-10 04:01:23,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:23,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:23,178 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-10 04:01:23,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:01:23,187 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:23,187 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:01:23,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:01:23,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:01:23,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:01:23,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:01:23,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:01:23,195 INFO L87 Difference]: Start difference. First operand 592 states and 901 transitions. Second operand 4 states. [2018-11-10 04:01:25,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:01:25,759 INFO L93 Difference]: Finished difference Result 1271 states and 1928 transitions. [2018-11-10 04:01:25,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:01:25,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-11-10 04:01:25,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:01:25,761 INFO L225 Difference]: With dead ends: 1271 [2018-11-10 04:01:25,761 INFO L226 Difference]: Without dead ends: 705 [2018-11-10 04:01:25,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 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-10 04:01:25,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2018-11-10 04:01:25,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 594. [2018-11-10 04:01:25,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-11-10 04:01:25,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 903 transitions. [2018-11-10 04:01:25,783 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 903 transitions. Word has length 92 [2018-11-10 04:01:25,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:01:25,783 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 903 transitions. [2018-11-10 04:01:25,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:01:25,783 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 903 transitions. [2018-11-10 04:01:25,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 04:01:25,784 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:01:25,784 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:01:25,784 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:01:25,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:25,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1136297924, now seen corresponding path program 1 times [2018-11-10 04:01:25,784 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:01:25,784 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 38 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 38 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:01:25,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:01:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:26,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:26,235 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-10 04:01:26,237 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-10 04:01:26,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:26,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:26,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:26,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:01:26,251 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 15 [2018-11-10 04:01:26,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, 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 3 [2018-11-10 04:01:26,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:26,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:26,255 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-10 04:01:26,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:01:26,262 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:01:26,263 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:01:26,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:01:26,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:01:26,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:01:26,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:01:26,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:01:26,266 INFO L87 Difference]: Start difference. First operand 594 states and 903 transitions. Second operand 4 states. [2018-11-10 04:01:28,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:01:28,792 INFO L93 Difference]: Finished difference Result 1253 states and 1904 transitions. [2018-11-10 04:01:28,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:01:28,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-11-10 04:01:28,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:01:28,794 INFO L225 Difference]: With dead ends: 1253 [2018-11-10 04:01:28,794 INFO L226 Difference]: Without dead ends: 685 [2018-11-10 04:01:28,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 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-10 04:01:28,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2018-11-10 04:01:28,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 594. [2018-11-10 04:01:28,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-11-10 04:01:28,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 901 transitions. [2018-11-10 04:01:28,817 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 901 transitions. Word has length 93 [2018-11-10 04:01:28,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:01:28,817 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 901 transitions. [2018-11-10 04:01:28,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:01:28,817 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 901 transitions. [2018-11-10 04:01:28,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 04:01:28,818 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:01:28,818 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:01:28,818 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:01:28,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:28,818 INFO L82 PathProgramCache]: Analyzing trace with hash 959893007, now seen corresponding path program 1 times [2018-11-10 04:01:28,819 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:01:28,819 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 39 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 39 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:01:28,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:01:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:29,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:29,260 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-10 04:01:29,261 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-10 04:01:29,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:29,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:29,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:29,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:01:29,276 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 15 [2018-11-10 04:01:29,278 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 3 [2018-11-10 04:01:29,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:29,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:29,280 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-10 04:01:29,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:01:29,289 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:29,289 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:01:29,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:01:29,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:01:29,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:01:29,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:01:29,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:01:29,293 INFO L87 Difference]: Start difference. First operand 594 states and 901 transitions. Second operand 4 states. [2018-11-10 04:01:31,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:01:31,826 INFO L93 Difference]: Finished difference Result 1253 states and 1900 transitions. [2018-11-10 04:01:31,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:01:31,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-11-10 04:01:31,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:01:31,828 INFO L225 Difference]: With dead ends: 1253 [2018-11-10 04:01:31,828 INFO L226 Difference]: Without dead ends: 685 [2018-11-10 04:01:31,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 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-10 04:01:31,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2018-11-10 04:01:31,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 594. [2018-11-10 04:01:31,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-11-10 04:01:31,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 899 transitions. [2018-11-10 04:01:31,852 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 899 transitions. Word has length 93 [2018-11-10 04:01:31,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:01:31,852 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 899 transitions. [2018-11-10 04:01:31,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:01:31,852 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 899 transitions. [2018-11-10 04:01:31,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 04:01:31,852 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:01:31,852 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:01:31,853 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:01:31,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:31,853 INFO L82 PathProgramCache]: Analyzing trace with hash -610315369, now seen corresponding path program 1 times [2018-11-10 04:01:31,853 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:01:31,853 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 40 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 40 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:01:31,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:01:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:32,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:32,298 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-10 04:01:32,300 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-10 04:01:32,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:32,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:32,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:32,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:01:32,311 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 15 [2018-11-10 04:01:32,312 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 3 [2018-11-10 04:01:32,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:32,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:32,315 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-10 04:01:32,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:01:32,324 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:32,324 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:01:32,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:01:32,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:01:32,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:01:32,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:01:32,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:01:32,328 INFO L87 Difference]: Start difference. First operand 594 states and 899 transitions. Second operand 4 states. [2018-11-10 04:01:34,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:01:34,838 INFO L93 Difference]: Finished difference Result 1249 states and 1892 transitions. [2018-11-10 04:01:34,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:01:34,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-11-10 04:01:34,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:01:34,840 INFO L225 Difference]: With dead ends: 1249 [2018-11-10 04:01:34,840 INFO L226 Difference]: Without dead ends: 681 [2018-11-10 04:01:34,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 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-10 04:01:34,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-11-10 04:01:34,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 596. [2018-11-10 04:01:34,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-11-10 04:01:34,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 901 transitions. [2018-11-10 04:01:34,863 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 901 transitions. Word has length 93 [2018-11-10 04:01:34,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:01:34,863 INFO L481 AbstractCegarLoop]: Abstraction has 596 states and 901 transitions. [2018-11-10 04:01:34,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:01:34,864 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 901 transitions. [2018-11-10 04:01:34,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 04:01:34,864 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:01:34,864 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:01:34,864 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:01:34,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:34,864 INFO L82 PathProgramCache]: Analyzing trace with hash 598775527, now seen corresponding path program 1 times [2018-11-10 04:01:34,865 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:01:34,865 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 41 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 41 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:01:34,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:01:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:35,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:35,330 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-10 04:01:35,332 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-10 04:01:35,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:35,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:35,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:35,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:01:35,343 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 15 [2018-11-10 04:01:35,345 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 3 [2018-11-10 04:01:35,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:35,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:35,347 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-10 04:01:35,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:01:35,356 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:35,356 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:01:35,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:01:35,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:01:35,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:01:35,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:01:35,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:01:35,359 INFO L87 Difference]: Start difference. First operand 596 states and 901 transitions. Second operand 4 states. [2018-11-10 04:01:37,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:01:37,893 INFO L93 Difference]: Finished difference Result 1247 states and 1886 transitions. [2018-11-10 04:01:37,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:01:37,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-11-10 04:01:37,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:01:37,895 INFO L225 Difference]: With dead ends: 1247 [2018-11-10 04:01:37,895 INFO L226 Difference]: Without dead ends: 677 [2018-11-10 04:01:37,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 91 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-10 04:01:37,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2018-11-10 04:01:37,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 596. [2018-11-10 04:01:37,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-11-10 04:01:37,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 899 transitions. [2018-11-10 04:01:37,918 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 899 transitions. Word has length 94 [2018-11-10 04:01:37,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:01:37,918 INFO L481 AbstractCegarLoop]: Abstraction has 596 states and 899 transitions. [2018-11-10 04:01:37,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:01:37,918 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 899 transitions. [2018-11-10 04:01:37,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 04:01:37,919 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:01:37,919 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:01:37,919 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:01:37,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:37,919 INFO L82 PathProgramCache]: Analyzing trace with hash 251255469, now seen corresponding path program 1 times [2018-11-10 04:01:37,919 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:01:37,919 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 42 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 42 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:01:37,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:01:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:38,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:38,367 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-10 04:01:38,369 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-10 04:01:38,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:38,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:38,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:38,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:01:38,381 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 15 [2018-11-10 04:01:38,383 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 3 [2018-11-10 04:01:38,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:38,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:38,386 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-10 04:01:38,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:01:38,395 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:38,395 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:01:38,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:01:38,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:01:38,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:01:38,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:01:38,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:01:38,399 INFO L87 Difference]: Start difference. First operand 596 states and 899 transitions. Second operand 4 states. [2018-11-10 04:01:40,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:01:40,900 INFO L93 Difference]: Finished difference Result 1241 states and 1874 transitions. [2018-11-10 04:01:40,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:01:40,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-11-10 04:01:40,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:01:40,901 INFO L225 Difference]: With dead ends: 1241 [2018-11-10 04:01:40,902 INFO L226 Difference]: Without dead ends: 671 [2018-11-10 04:01:40,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 91 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-10 04:01:40,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2018-11-10 04:01:40,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 598. [2018-11-10 04:01:40,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-11-10 04:01:40,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 901 transitions. [2018-11-10 04:01:40,925 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 901 transitions. Word has length 94 [2018-11-10 04:01:40,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:01:40,925 INFO L481 AbstractCegarLoop]: Abstraction has 598 states and 901 transitions. [2018-11-10 04:01:40,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:01:40,925 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 901 transitions. [2018-11-10 04:01:40,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-10 04:01:40,925 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:01:40,926 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 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-10 04:01:40,926 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:01:40,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:40,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1301709822, now seen corresponding path program 1 times [2018-11-10 04:01:40,926 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:01:40,926 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 43 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 43 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:01:40,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:01:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:41,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:41,875 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 18 treesize of output 15 [2018-11-10 04:01:41,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 04:01:41,880 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:01:41,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:01:41,883 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:41,892 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:41,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:41,903 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-10 04:01:41,904 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:01:41,914 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 15 [2018-11-10 04:01:41,915 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 3 [2018-11-10 04:01:41,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:41,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:41,919 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-10 04:01:41,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 04:01:41,931 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:01:41,931 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:01:41,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:01:41,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:01:41,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:01:41,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:01:41,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:01:41,935 INFO L87 Difference]: Start difference. First operand 598 states and 901 transitions. Second operand 7 states. [2018-11-10 04:01:44,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:01:44,679 INFO L93 Difference]: Finished difference Result 907 states and 1375 transitions. [2018-11-10 04:01:44,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:01:44,679 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-11-10 04:01:44,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:01:44,681 INFO L225 Difference]: With dead ends: 907 [2018-11-10 04:01:44,681 INFO L226 Difference]: Without dead ends: 606 [2018-11-10 04:01:44,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:01:44,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2018-11-10 04:01:44,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 598. [2018-11-10 04:01:44,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-11-10 04:01:44,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 900 transitions. [2018-11-10 04:01:44,704 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 900 transitions. Word has length 96 [2018-11-10 04:01:44,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:01:44,704 INFO L481 AbstractCegarLoop]: Abstraction has 598 states and 900 transitions. [2018-11-10 04:01:44,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:01:44,704 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 900 transitions. [2018-11-10 04:01:44,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 04:01:44,704 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:01:44,705 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:01:44,705 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:01:44,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:44,705 INFO L82 PathProgramCache]: Analyzing trace with hash 829943983, now seen corresponding path program 1 times [2018-11-10 04:01:44,705 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:01:44,705 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 44 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 44 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:01:44,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:01:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:45,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:45,150 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-10 04:01:45,152 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-10 04:01:45,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:45,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:45,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:45,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:01:45,164 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 15 [2018-11-10 04:01:45,165 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 3 [2018-11-10 04:01:45,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:45,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:45,167 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-10 04:01:45,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:01:45,187 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:45,187 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:01:45,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:01:45,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:01:45,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:01:45,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:01:45,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:01:45,190 INFO L87 Difference]: Start difference. First operand 598 states and 900 transitions. Second operand 4 states. [2018-11-10 04:01:47,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:01:47,702 INFO L93 Difference]: Finished difference Result 1243 states and 1872 transitions. [2018-11-10 04:01:47,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:01:47,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-11-10 04:01:47,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:01:47,705 INFO L225 Difference]: With dead ends: 1243 [2018-11-10 04:01:47,705 INFO L226 Difference]: Without dead ends: 671 [2018-11-10 04:01:47,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 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-10 04:01:47,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2018-11-10 04:01:47,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 600. [2018-11-10 04:01:47,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-11-10 04:01:47,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 902 transitions. [2018-11-10 04:01:47,734 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 902 transitions. Word has length 97 [2018-11-10 04:01:47,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:01:47,734 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 902 transitions. [2018-11-10 04:01:47,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:01:47,734 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 902 transitions. [2018-11-10 04:01:47,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-10 04:01:47,735 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:01:47,735 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:01:47,735 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:01:47,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:47,736 INFO L82 PathProgramCache]: Analyzing trace with hash -618572222, now seen corresponding path program 1 times [2018-11-10 04:01:47,736 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:01:47,736 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 45 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 45 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:01:47,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:01:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:48,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:48,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 04:01:48,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 04:01:48,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:48,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:48,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:48,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:01:48,219 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 15 [2018-11-10 04:01:48,220 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 3 [2018-11-10 04:01:48,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:48,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:48,234 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-10 04:01:48,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:01:48,244 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:48,244 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:01:48,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:01:48,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:01:48,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:01:48,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:01:48,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:01:48,248 INFO L87 Difference]: Start difference. First operand 600 states and 902 transitions. Second operand 4 states. [2018-11-10 04:01:50,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:01:50,732 INFO L93 Difference]: Finished difference Result 1233 states and 1856 transitions. [2018-11-10 04:01:50,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:01:50,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-11-10 04:01:50,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:01:50,734 INFO L225 Difference]: With dead ends: 1233 [2018-11-10 04:01:50,735 INFO L226 Difference]: Without dead ends: 659 [2018-11-10 04:01:50,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 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-10 04:01:50,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-11-10 04:01:50,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 602. [2018-11-10 04:01:50,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-11-10 04:01:50,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 904 transitions. [2018-11-10 04:01:50,760 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 904 transitions. Word has length 98 [2018-11-10 04:01:50,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:01:50,760 INFO L481 AbstractCegarLoop]: Abstraction has 602 states and 904 transitions. [2018-11-10 04:01:50,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:01:50,760 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 904 transitions. [2018-11-10 04:01:50,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-10 04:01:50,761 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:01:50,761 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:01:50,761 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:01:50,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:50,761 INFO L82 PathProgramCache]: Analyzing trace with hash -542645439, now seen corresponding path program 1 times [2018-11-10 04:01:50,762 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:01:50,762 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 46 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 46 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:01:50,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:01:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:51,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:51,241 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-10 04:01:51,243 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-10 04:01:51,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:51,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:51,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:51,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:01:51,254 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 15 [2018-11-10 04:01:51,255 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 3 [2018-11-10 04:01:51,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:51,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:51,266 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-10 04:01:51,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:01:51,277 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:51,277 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:01:51,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:01:51,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:01:51,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:01:51,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:01:51,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:01:51,280 INFO L87 Difference]: Start difference. First operand 602 states and 904 transitions. Second operand 4 states. [2018-11-10 04:01:53,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:01:53,777 INFO L93 Difference]: Finished difference Result 1235 states and 1856 transitions. [2018-11-10 04:01:53,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:01:53,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-11-10 04:01:53,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:01:53,779 INFO L225 Difference]: With dead ends: 1235 [2018-11-10 04:01:53,779 INFO L226 Difference]: Without dead ends: 659 [2018-11-10 04:01:53,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 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-10 04:01:53,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-11-10 04:01:53,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 604. [2018-11-10 04:01:53,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-11-10 04:01:53,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 906 transitions. [2018-11-10 04:01:53,803 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 906 transitions. Word has length 98 [2018-11-10 04:01:53,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:01:53,804 INFO L481 AbstractCegarLoop]: Abstraction has 604 states and 906 transitions. [2018-11-10 04:01:53,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:01:53,804 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 906 transitions. [2018-11-10 04:01:53,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-10 04:01:53,804 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:01:53,804 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:01:53,804 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:01:53,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:53,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1273993042, now seen corresponding path program 1 times [2018-11-10 04:01:53,805 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:01:53,805 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 47 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 47 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:01:53,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:01:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:54,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:54,268 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-10 04:01:54,270 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-10 04:01:54,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:54,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:54,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:54,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:01:54,284 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 15 [2018-11-10 04:01:54,286 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 3 [2018-11-10 04:01:54,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:54,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:54,288 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-10 04:01:54,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:01:54,300 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:54,300 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:01:54,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:01:54,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:01:54,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:01:54,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:01:54,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:01:54,303 INFO L87 Difference]: Start difference. First operand 604 states and 906 transitions. Second operand 4 states. [2018-11-10 04:01:56,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:01:56,801 INFO L93 Difference]: Finished difference Result 1231 states and 1849 transitions. [2018-11-10 04:01:56,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:01:56,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-11-10 04:01:56,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:01:56,802 INFO L225 Difference]: With dead ends: 1231 [2018-11-10 04:01:56,802 INFO L226 Difference]: Without dead ends: 653 [2018-11-10 04:01:56,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 96 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-10 04:01:56,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-11-10 04:01:56,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 606. [2018-11-10 04:01:56,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-11-10 04:01:56,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 908 transitions. [2018-11-10 04:01:56,826 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 908 transitions. Word has length 99 [2018-11-10 04:01:56,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:01:56,826 INFO L481 AbstractCegarLoop]: Abstraction has 606 states and 908 transitions. [2018-11-10 04:01:56,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:01:56,826 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 908 transitions. [2018-11-10 04:01:56,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 04:01:56,827 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:01:56,827 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2018-11-10 04:01:56,827 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:01:56,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:56,827 INFO L82 PathProgramCache]: Analyzing trace with hash -674572391, now seen corresponding path program 1 times [2018-11-10 04:01:56,827 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:01:56,828 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 48 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 48 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:01:56,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:01:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:01:57,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:01:57,292 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-10 04:01:57,294 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-10 04:01:57,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:57,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:57,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:57,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:01:57,307 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 15 [2018-11-10 04:01:57,309 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 3 [2018-11-10 04:01:57,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:01:57,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:01:57,311 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-10 04:01:57,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:01:57,321 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:01:57,321 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:01:57,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:01:57,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:01:57,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:01:57,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:01:57,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:01:57,324 INFO L87 Difference]: Start difference. First operand 606 states and 908 transitions. Second operand 4 states. [2018-11-10 04:01:59,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:01:59,832 INFO L93 Difference]: Finished difference Result 1233 states and 1849 transitions. [2018-11-10 04:01:59,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:01:59,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-11-10 04:01:59,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:01:59,833 INFO L225 Difference]: With dead ends: 1233 [2018-11-10 04:01:59,834 INFO L226 Difference]: Without dead ends: 653 [2018-11-10 04:01:59,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 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-10 04:01:59,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-11-10 04:01:59,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 608. [2018-11-10 04:01:59,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-11-10 04:01:59,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 910 transitions. [2018-11-10 04:01:59,857 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 910 transitions. Word has length 100 [2018-11-10 04:01:59,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:01:59,858 INFO L481 AbstractCegarLoop]: Abstraction has 608 states and 910 transitions. [2018-11-10 04:01:59,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:01:59,858 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 910 transitions. [2018-11-10 04:01:59,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-10 04:01:59,858 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:01:59,858 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2018-11-10 04:01:59,858 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:01:59,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:01:59,859 INFO L82 PathProgramCache]: Analyzing trace with hash 2097999462, now seen corresponding path program 1 times [2018-11-10 04:01:59,859 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:01:59,859 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 49 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 49 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:01:59,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:00,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:02:00,326 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-10 04:02:00,328 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-10 04:02:00,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:00,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:00,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:00,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:02:00,342 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 15 [2018-11-10 04:02:00,346 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 3 [2018-11-10 04:02:00,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:00,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:00,349 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-10 04:02:00,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:02:00,359 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:02:00,359 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:02:00,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:00,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:02:00,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:02:00,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:02:00,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:02:00,362 INFO L87 Difference]: Start difference. First operand 608 states and 910 transitions. Second operand 4 states. [2018-11-10 04:02:02,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:02,822 INFO L93 Difference]: Finished difference Result 1229 states and 1842 transitions. [2018-11-10 04:02:02,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:02:02,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-11-10 04:02:02,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:02,825 INFO L225 Difference]: With dead ends: 1229 [2018-11-10 04:02:02,825 INFO L226 Difference]: Without dead ends: 647 [2018-11-10 04:02:02,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 98 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-10 04:02:02,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2018-11-10 04:02:02,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 610. [2018-11-10 04:02:02,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-11-10 04:02:02,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 912 transitions. [2018-11-10 04:02:02,851 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 912 transitions. Word has length 101 [2018-11-10 04:02:02,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:02,851 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 912 transitions. [2018-11-10 04:02:02,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:02:02,851 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 912 transitions. [2018-11-10 04:02:02,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 04:02:02,852 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:02,852 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-10 04:02:02,852 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:02,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:02,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1153937114, now seen corresponding path program 1 times [2018-11-10 04:02:02,853 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:02:02,853 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 50 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 50 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:02:02,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:03,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:02:03,818 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-10 04:02:03,820 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-10 04:02:03,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:03,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:03,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:03,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:02:03,842 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 23 treesize of output 18 [2018-11-10 04:02:03,844 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:02:03,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:02:03,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:03,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:03,859 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-10 04:02:03,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:02:03,861 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 15 [2018-11-10 04:02:03,863 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 3 [2018-11-10 04:02:03,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:03,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:03,867 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-10 04:02:03,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 04:02:03,882 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:02:03,882 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:02:03,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:03,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:02:03,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:02:03,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:02:03,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:02:03,887 INFO L87 Difference]: Start difference. First operand 610 states and 912 transitions. Second operand 7 states. [2018-11-10 04:02:06,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:06,856 INFO L93 Difference]: Finished difference Result 1343 states and 1990 transitions. [2018-11-10 04:02:06,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:02:06,856 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2018-11-10 04:02:06,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:06,857 INFO L225 Difference]: With dead ends: 1343 [2018-11-10 04:02:06,858 INFO L226 Difference]: Without dead ends: 759 [2018-11-10 04:02:06,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:02:06,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-11-10 04:02:06,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 610. [2018-11-10 04:02:06,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-11-10 04:02:06,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 910 transitions. [2018-11-10 04:02:06,883 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 910 transitions. Word has length 106 [2018-11-10 04:02:06,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:06,884 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 910 transitions. [2018-11-10 04:02:06,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:02:06,884 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 910 transitions. [2018-11-10 04:02:06,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 04:02:06,885 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:06,885 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-10 04:02:06,885 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:06,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:06,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1880112932, now seen corresponding path program 1 times [2018-11-10 04:02:06,886 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:02:06,886 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 51 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 51 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:02:06,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:07,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:07,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:02:07,865 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-10 04:02:07,867 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-10 04:02:07,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:07,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:07,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:07,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:02:07,890 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 23 treesize of output 18 [2018-11-10 04:02:07,892 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:02:07,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:02:07,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:07,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:07,906 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-10 04:02:07,906 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:02:07,908 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 15 [2018-11-10 04:02:07,910 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 3 [2018-11-10 04:02:07,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:07,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:07,914 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-10 04:02:07,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 04:02:07,926 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:02:07,926 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:02:07,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:07,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:02:07,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:02:07,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:02:07,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:02:07,930 INFO L87 Difference]: Start difference. First operand 610 states and 910 transitions. Second operand 7 states. [2018-11-10 04:02:10,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:10,783 INFO L93 Difference]: Finished difference Result 1259 states and 1872 transitions. [2018-11-10 04:02:10,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:02:10,784 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2018-11-10 04:02:10,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:10,785 INFO L225 Difference]: With dead ends: 1259 [2018-11-10 04:02:10,785 INFO L226 Difference]: Without dead ends: 675 [2018-11-10 04:02:10,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:02:10,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2018-11-10 04:02:10,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 610. [2018-11-10 04:02:10,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-11-10 04:02:10,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 908 transitions. [2018-11-10 04:02:10,813 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 908 transitions. Word has length 106 [2018-11-10 04:02:10,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:10,813 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 908 transitions. [2018-11-10 04:02:10,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:02:10,813 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 908 transitions. [2018-11-10 04:02:10,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 04:02:10,814 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:10,814 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:02:10,814 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:10,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:10,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1239340172, now seen corresponding path program 1 times [2018-11-10 04:02:10,815 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:02:10,815 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 52 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 52 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:02:10,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:11,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:02:11,327 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-10 04:02:11,329 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-10 04:02:11,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:11,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:11,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:11,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:02:11,340 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 15 [2018-11-10 04:02:11,342 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 3 [2018-11-10 04:02:11,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:11,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:11,344 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-10 04:02:11,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:02:11,354 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:02:11,354 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:02:11,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:11,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:02:11,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:02:11,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:02:11,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:02:11,357 INFO L87 Difference]: Start difference. First operand 610 states and 908 transitions. Second operand 4 states. [2018-11-10 04:02:13,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:13,822 INFO L93 Difference]: Finished difference Result 1231 states and 1834 transitions. [2018-11-10 04:02:13,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:02:13,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-11-10 04:02:13,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:13,824 INFO L225 Difference]: With dead ends: 1231 [2018-11-10 04:02:13,825 INFO L226 Difference]: Without dead ends: 647 [2018-11-10 04:02:13,825 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 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-10 04:02:13,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2018-11-10 04:02:13,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 616. [2018-11-10 04:02:13,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-11-10 04:02:13,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 914 transitions. [2018-11-10 04:02:13,852 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 914 transitions. Word has length 107 [2018-11-10 04:02:13,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:13,852 INFO L481 AbstractCegarLoop]: Abstraction has 616 states and 914 transitions. [2018-11-10 04:02:13,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:02:13,852 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 914 transitions. [2018-11-10 04:02:13,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 04:02:13,853 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:13,853 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 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-10 04:02:13,853 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:13,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:13,853 INFO L82 PathProgramCache]: Analyzing trace with hash -596275348, now seen corresponding path program 1 times [2018-11-10 04:02:13,853 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:02:13,853 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 53 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 53 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:02:13,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:14,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:02:14,826 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-10 04:02:14,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 10 treesize of output 9 [2018-11-10 04:02:14,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:14,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:14,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:14,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:02:14,849 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 23 treesize of output 18 [2018-11-10 04:02:14,851 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:02:14,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:02:14,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:14,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:14,864 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-10 04:02:14,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:02:14,867 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 15 [2018-11-10 04:02:14,868 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 3 [2018-11-10 04:02:14,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:14,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:14,872 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-10 04:02:14,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 04:02:14,897 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:02:14,898 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:02:14,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:14,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:02:14,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:02:14,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:02:14,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:02:14,902 INFO L87 Difference]: Start difference. First operand 616 states and 914 transitions. Second operand 7 states. [2018-11-10 04:02:17,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:17,852 INFO L93 Difference]: Finished difference Result 1351 states and 1990 transitions. [2018-11-10 04:02:17,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:02:17,853 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2018-11-10 04:02:17,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:17,854 INFO L225 Difference]: With dead ends: 1351 [2018-11-10 04:02:17,854 INFO L226 Difference]: Without dead ends: 761 [2018-11-10 04:02:17,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:02:17,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2018-11-10 04:02:17,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 616. [2018-11-10 04:02:17,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-11-10 04:02:17,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 912 transitions. [2018-11-10 04:02:17,885 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 912 transitions. Word has length 107 [2018-11-10 04:02:17,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:17,885 INFO L481 AbstractCegarLoop]: Abstraction has 616 states and 912 transitions. [2018-11-10 04:02:17,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:02:17,885 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 912 transitions. [2018-11-10 04:02:17,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 04:02:17,886 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:17,886 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 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-10 04:02:17,886 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:17,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:17,886 INFO L82 PathProgramCache]: Analyzing trace with hash -162546262, now seen corresponding path program 1 times [2018-11-10 04:02:17,887 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:02:17,887 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 54 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 54 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:02:17,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:18,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:02:18,925 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-10 04:02:18,926 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-10 04:02:18,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:18,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:18,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:18,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:02:18,946 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 23 treesize of output 18 [2018-11-10 04:02:18,949 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:02:18,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:02:18,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:18,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:18,963 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-10 04:02:18,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:02:18,965 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 15 [2018-11-10 04:02:18,967 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 3 [2018-11-10 04:02:18,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:18,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:18,971 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-10 04:02:18,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 04:02:18,984 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:02:18,984 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:02:18,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:18,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:02:18,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:02:18,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:02:18,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:02:18,988 INFO L87 Difference]: Start difference. First operand 616 states and 912 transitions. Second operand 7 states. [2018-11-10 04:02:19,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:19,830 INFO L93 Difference]: Finished difference Result 1271 states and 1876 transitions. [2018-11-10 04:02:19,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:02:19,831 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2018-11-10 04:02:19,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:19,833 INFO L225 Difference]: With dead ends: 1271 [2018-11-10 04:02:19,833 INFO L226 Difference]: Without dead ends: 681 [2018-11-10 04:02:19,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:02:19,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-11-10 04:02:19,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 616. [2018-11-10 04:02:19,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-11-10 04:02:19,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 910 transitions. [2018-11-10 04:02:19,863 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 910 transitions. Word has length 107 [2018-11-10 04:02:19,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:19,863 INFO L481 AbstractCegarLoop]: Abstraction has 616 states and 910 transitions. [2018-11-10 04:02:19,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:02:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 910 transitions. [2018-11-10 04:02:19,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 04:02:19,864 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:19,864 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:02:19,864 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:19,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:19,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1792478521, now seen corresponding path program 1 times [2018-11-10 04:02:19,864 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:02:19,864 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 55 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 55 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:02:19,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:20,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:02:20,375 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-10 04:02:20,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 04:02:20,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:20,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:20,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:20,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:02:20,388 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 15 [2018-11-10 04:02:20,390 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 3 [2018-11-10 04:02:20,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:20,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:20,392 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-10 04:02:20,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:02:20,403 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:02:20,403 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:02:20,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:20,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:02:20,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:02:20,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:02:20,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:02:20,406 INFO L87 Difference]: Start difference. First operand 616 states and 910 transitions. Second operand 4 states. [2018-11-10 04:02:22,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:22,877 INFO L93 Difference]: Finished difference Result 1227 states and 1818 transitions. [2018-11-10 04:02:22,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:02:22,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-11-10 04:02:22,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:22,879 INFO L225 Difference]: With dead ends: 1227 [2018-11-10 04:02:22,879 INFO L226 Difference]: Without dead ends: 637 [2018-11-10 04:02:22,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 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-10 04:02:22,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2018-11-10 04:02:22,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 618. [2018-11-10 04:02:22,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-11-10 04:02:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 912 transitions. [2018-11-10 04:02:22,920 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 912 transitions. Word has length 108 [2018-11-10 04:02:22,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:22,920 INFO L481 AbstractCegarLoop]: Abstraction has 618 states and 912 transitions. [2018-11-10 04:02:22,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:02:22,920 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 912 transitions. [2018-11-10 04:02:22,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 04:02:22,921 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:22,921 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 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-10 04:02:22,921 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:22,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:22,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1534650997, now seen corresponding path program 1 times [2018-11-10 04:02:22,922 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:02:22,922 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 56 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 56 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:02:22,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:23,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:02:23,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-10 04:02:23,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-10 04:02:23,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:23,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:23,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:23,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:02:23,957 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 23 treesize of output 18 [2018-11-10 04:02:23,960 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:02:23,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:02:23,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:23,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:23,975 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-10 04:02:23,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:02:23,977 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 15 [2018-11-10 04:02:23,978 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 3 [2018-11-10 04:02:23,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:23,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:23,982 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-10 04:02:23,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 04:02:23,995 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:02:23,995 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:02:23,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:23,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:02:23,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:02:23,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:02:23,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:02:23,999 INFO L87 Difference]: Start difference. First operand 618 states and 912 transitions. Second operand 7 states. [2018-11-10 04:02:24,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:24,915 INFO L93 Difference]: Finished difference Result 1355 states and 1986 transitions. [2018-11-10 04:02:24,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:02:24,915 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 108 [2018-11-10 04:02:24,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:24,916 INFO L225 Difference]: With dead ends: 1355 [2018-11-10 04:02:24,916 INFO L226 Difference]: Without dead ends: 763 [2018-11-10 04:02:24,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:02:24,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2018-11-10 04:02:24,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 618. [2018-11-10 04:02:24,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-11-10 04:02:24,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 910 transitions. [2018-11-10 04:02:24,944 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 910 transitions. Word has length 108 [2018-11-10 04:02:24,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:24,944 INFO L481 AbstractCegarLoop]: Abstraction has 618 states and 910 transitions. [2018-11-10 04:02:24,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:02:24,944 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 910 transitions. [2018-11-10 04:02:24,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 04:02:24,945 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:24,945 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 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-10 04:02:24,945 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:24,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:24,945 INFO L82 PathProgramCache]: Analyzing trace with hash 2095350775, now seen corresponding path program 1 times [2018-11-10 04:02:24,946 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:02:24,946 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 57 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 57 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:02:24,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:25,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:02:25,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 13 treesize of output 10 [2018-11-10 04:02:25,968 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-10 04:02:25,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:25,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:25,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:25,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:02:25,990 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 23 treesize of output 18 [2018-11-10 04:02:25,992 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:02:25,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:02:25,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:25,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:26,007 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-10 04:02:26,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:02:26,009 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 15 [2018-11-10 04:02:26,010 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 3 [2018-11-10 04:02:26,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:26,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:26,015 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-10 04:02:26,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 04:02:26,028 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:02:26,028 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:02:26,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:26,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:02:26,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:02:26,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:02:26,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:02:26,033 INFO L87 Difference]: Start difference. First operand 618 states and 910 transitions. Second operand 7 states. [2018-11-10 04:02:26,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:26,889 INFO L93 Difference]: Finished difference Result 1275 states and 1872 transitions. [2018-11-10 04:02:26,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:02:26,889 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 108 [2018-11-10 04:02:26,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:26,890 INFO L225 Difference]: With dead ends: 1275 [2018-11-10 04:02:26,890 INFO L226 Difference]: Without dead ends: 683 [2018-11-10 04:02:26,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:02:26,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-11-10 04:02:26,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 618. [2018-11-10 04:02:26,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-11-10 04:02:26,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 908 transitions. [2018-11-10 04:02:26,918 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 908 transitions. Word has length 108 [2018-11-10 04:02:26,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:26,918 INFO L481 AbstractCegarLoop]: Abstraction has 618 states and 908 transitions. [2018-11-10 04:02:26,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:02:26,918 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 908 transitions. [2018-11-10 04:02:26,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 04:02:26,919 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:26,919 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:02:26,919 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:26,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:26,919 INFO L82 PathProgramCache]: Analyzing trace with hash 632335343, now seen corresponding path program 1 times [2018-11-10 04:02:26,920 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:02:26,920 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 58 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 58 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:02:26,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:27,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:02:27,454 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-10 04:02:27,456 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-10 04:02:27,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:27,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:27,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:27,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:02:27,469 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 15 [2018-11-10 04:02:27,470 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 3 [2018-11-10 04:02:27,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:27,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:27,473 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-10 04:02:27,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:02:27,485 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:02:27,485 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:02:27,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:27,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:02:27,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:02:27,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:02:27,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:02:27,489 INFO L87 Difference]: Start difference. First operand 618 states and 908 transitions. Second operand 4 states. [2018-11-10 04:02:29,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:29,936 INFO L93 Difference]: Finished difference Result 1229 states and 1810 transitions. [2018-11-10 04:02:29,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:02:29,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2018-11-10 04:02:29,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:29,938 INFO L225 Difference]: With dead ends: 1229 [2018-11-10 04:02:29,938 INFO L226 Difference]: Without dead ends: 637 [2018-11-10 04:02:29,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 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-10 04:02:29,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2018-11-10 04:02:29,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 620. [2018-11-10 04:02:29,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-11-10 04:02:29,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 910 transitions. [2018-11-10 04:02:29,967 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 910 transitions. Word has length 109 [2018-11-10 04:02:29,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:29,967 INFO L481 AbstractCegarLoop]: Abstraction has 620 states and 910 transitions. [2018-11-10 04:02:29,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:02:29,968 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 910 transitions. [2018-11-10 04:02:29,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 04:02:29,968 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:29,969 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 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-10 04:02:29,969 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:29,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:29,969 INFO L82 PathProgramCache]: Analyzing trace with hash -573171225, now seen corresponding path program 1 times [2018-11-10 04:02:29,970 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:02:29,970 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 59 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 59 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:02:29,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:30,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:02:30,981 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-10 04:02:30,983 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-10 04:02:30,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:30,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:30,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:30,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:02:31,003 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 23 treesize of output 18 [2018-11-10 04:02:31,006 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:02:31,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:02:31,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:31,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:31,020 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-10 04:02:31,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:02:31,023 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 15 [2018-11-10 04:02:31,024 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 3 [2018-11-10 04:02:31,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:31,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:31,028 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-10 04:02:31,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 04:02:31,042 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:02:31,042 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:02:31,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:31,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:02:31,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:02:31,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:02:31,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:02:31,046 INFO L87 Difference]: Start difference. First operand 620 states and 910 transitions. Second operand 7 states. [2018-11-10 04:02:31,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:31,946 INFO L93 Difference]: Finished difference Result 1339 states and 1956 transitions. [2018-11-10 04:02:31,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:02:31,947 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-11-10 04:02:31,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:31,948 INFO L225 Difference]: With dead ends: 1339 [2018-11-10 04:02:31,948 INFO L226 Difference]: Without dead ends: 745 [2018-11-10 04:02:31,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:02:31,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2018-11-10 04:02:31,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 620. [2018-11-10 04:02:31,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-11-10 04:02:31,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 908 transitions. [2018-11-10 04:02:31,978 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 908 transitions. Word has length 109 [2018-11-10 04:02:31,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:31,978 INFO L481 AbstractCegarLoop]: Abstraction has 620 states and 908 transitions. [2018-11-10 04:02:31,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:02:31,979 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 908 transitions. [2018-11-10 04:02:31,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 04:02:31,979 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:31,979 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 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-10 04:02:31,979 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:31,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:31,980 INFO L82 PathProgramCache]: Analyzing trace with hash -371347291, now seen corresponding path program 1 times [2018-11-10 04:02:31,980 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:02:31,980 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 60 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 60 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:02:32,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:33,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:02:33,012 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-10 04:02:33,015 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-10 04:02:33,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:33,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:33,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:33,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:02:33,037 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 23 treesize of output 18 [2018-11-10 04:02:33,040 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:02:33,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:02:33,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:33,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:33,054 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-10 04:02:33,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:02:33,057 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 15 [2018-11-10 04:02:33,058 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 3 [2018-11-10 04:02:33,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:33,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:33,062 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-10 04:02:33,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 04:02:33,075 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:02:33,075 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:02:33,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:33,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:02:33,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:02:33,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:02:33,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:02:33,079 INFO L87 Difference]: Start difference. First operand 620 states and 908 transitions. Second operand 7 states. [2018-11-10 04:02:35,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:35,931 INFO L93 Difference]: Finished difference Result 1259 states and 1842 transitions. [2018-11-10 04:02:35,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:02:35,931 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-11-10 04:02:35,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:35,933 INFO L225 Difference]: With dead ends: 1259 [2018-11-10 04:02:35,933 INFO L226 Difference]: Without dead ends: 665 [2018-11-10 04:02:35,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:02:35,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-11-10 04:02:35,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 620. [2018-11-10 04:02:35,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-11-10 04:02:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 906 transitions. [2018-11-10 04:02:35,964 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 906 transitions. Word has length 109 [2018-11-10 04:02:35,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:35,964 INFO L481 AbstractCegarLoop]: Abstraction has 620 states and 906 transitions. [2018-11-10 04:02:35,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:02:35,964 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 906 transitions. [2018-11-10 04:02:35,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 04:02:35,965 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:35,965 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:02:35,965 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:35,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:35,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1285320162, now seen corresponding path program 1 times [2018-11-10 04:02:35,966 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:02:35,966 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 61 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 61 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:02:35,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:36,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:02:36,504 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-10 04:02:36,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-10 04:02:36,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:36,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:36,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:36,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:02:36,529 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 15 [2018-11-10 04:02:36,531 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 3 [2018-11-10 04:02:36,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:36,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:36,536 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-10 04:02:36,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:02:36,552 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:02:36,553 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:02:36,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:36,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:02:36,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:02:36,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:02:36,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:02:36,557 INFO L87 Difference]: Start difference. First operand 620 states and 906 transitions. Second operand 4 states. [2018-11-10 04:02:38,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:38,996 INFO L93 Difference]: Finished difference Result 988 states and 1437 transitions. [2018-11-10 04:02:38,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:02:38,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-11-10 04:02:38,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:38,997 INFO L225 Difference]: With dead ends: 988 [2018-11-10 04:02:38,997 INFO L226 Difference]: Without dead ends: 348 [2018-11-10 04:02:38,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 107 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-10 04:02:38,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-11-10 04:02:39,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 341. [2018-11-10 04:02:39,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-11-10 04:02:39,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 505 transitions. [2018-11-10 04:02:39,021 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 505 transitions. Word has length 110 [2018-11-10 04:02:39,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:39,021 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 505 transitions. [2018-11-10 04:02:39,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:02:39,021 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 505 transitions. [2018-11-10 04:02:39,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 04:02:39,021 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:39,022 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:02:39,022 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:39,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:39,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1222238925, now seen corresponding path program 1 times [2018-11-10 04:02:39,023 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:02:39,023 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 62 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 62 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:02:39,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:40,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:02:40,042 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-10 04:02:40,044 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-10 04:02:40,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:40,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:40,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:40,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:02:40,072 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 23 treesize of output 18 [2018-11-10 04:02:40,075 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:02:40,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:02:40,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:40,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:40,093 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-10 04:02:40,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:02:40,096 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 13 [2018-11-10 04:02:40,097 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-10 04:02:40,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:40,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:40,099 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-10 04:02:40,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:02:40,111 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:02:40,112 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:02:40,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:40,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:02:40,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:02:40,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:02:40,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:02:40,116 INFO L87 Difference]: Start difference. First operand 341 states and 505 transitions. Second operand 7 states. [2018-11-10 04:02:40,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:40,929 INFO L93 Difference]: Finished difference Result 694 states and 1036 transitions. [2018-11-10 04:02:40,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:02:40,930 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-11-10 04:02:40,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:40,930 INFO L225 Difference]: With dead ends: 694 [2018-11-10 04:02:40,930 INFO L226 Difference]: Without dead ends: 404 [2018-11-10 04:02:40,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:02:40,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-11-10 04:02:40,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 341. [2018-11-10 04:02:40,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-11-10 04:02:40,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 504 transitions. [2018-11-10 04:02:40,968 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 504 transitions. Word has length 113 [2018-11-10 04:02:40,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:40,968 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 504 transitions. [2018-11-10 04:02:40,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:02:40,968 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 504 transitions. [2018-11-10 04:02:40,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 04:02:40,969 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:40,969 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:02:40,969 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:40,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:40,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1167846027, now seen corresponding path program 1 times [2018-11-10 04:02:40,970 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:02:40,970 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 63 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 63 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:02:40,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:41,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:02:42,019 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 18 treesize of output 15 [2018-11-10 04:02:42,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 04:02:42,023 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:02:42,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:02:42,024 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:42,030 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:42,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:42,041 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-10 04:02:42,042 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:02:42,075 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 04:02:42,075 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:02:42,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:42,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:02:42,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:02:42,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:02:42,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:02:42,079 INFO L87 Difference]: Start difference. First operand 341 states and 504 transitions. Second operand 7 states. [2018-11-10 04:02:44,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:44,815 INFO L93 Difference]: Finished difference Result 693 states and 1037 transitions. [2018-11-10 04:02:44,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:02:44,816 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-11-10 04:02:44,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:44,817 INFO L225 Difference]: With dead ends: 693 [2018-11-10 04:02:44,817 INFO L226 Difference]: Without dead ends: 403 [2018-11-10 04:02:44,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:02:44,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-11-10 04:02:44,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 368. [2018-11-10 04:02:44,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-11-10 04:02:44,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 549 transitions. [2018-11-10 04:02:44,835 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 549 transitions. Word has length 113 [2018-11-10 04:02:44,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:44,835 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 549 transitions. [2018-11-10 04:02:44,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:02:44,835 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 549 transitions. [2018-11-10 04:02:44,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 04:02:44,836 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:44,836 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:02:44,836 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:44,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:44,836 INFO L82 PathProgramCache]: Analyzing trace with hash 550997210, now seen corresponding path program 1 times [2018-11-10 04:02:44,837 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:02:44,837 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 64 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 64 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:02:44,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:45,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:02:45,418 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-10 04:02:45,420 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-10 04:02:45,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:45,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:45,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:45,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:02:45,431 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 15 [2018-11-10 04:02:45,433 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 3 [2018-11-10 04:02:45,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:45,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:45,436 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-10 04:02:45,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:02:45,451 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 04:02:45,452 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:02:45,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:45,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:02:45,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:02:45,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:02:45,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:02:45,456 INFO L87 Difference]: Start difference. First operand 368 states and 549 transitions. Second operand 4 states. [2018-11-10 04:02:48,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:48,032 INFO L93 Difference]: Finished difference Result 761 states and 1150 transitions. [2018-11-10 04:02:48,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:02:48,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2018-11-10 04:02:48,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:48,033 INFO L225 Difference]: With dead ends: 761 [2018-11-10 04:02:48,033 INFO L226 Difference]: Without dead ends: 444 [2018-11-10 04:02:48,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 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-10 04:02:48,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-11-10 04:02:48,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 399. [2018-11-10 04:02:48,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-11-10 04:02:48,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 602 transitions. [2018-11-10 04:02:48,054 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 602 transitions. Word has length 116 [2018-11-10 04:02:48,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:48,054 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 602 transitions. [2018-11-10 04:02:48,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:02:48,054 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 602 transitions. [2018-11-10 04:02:48,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-10 04:02:48,055 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:48,055 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:02:48,055 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:48,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:48,056 INFO L82 PathProgramCache]: Analyzing trace with hash 484593370, now seen corresponding path program 1 times [2018-11-10 04:02:48,056 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:02:48,056 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 65 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 65 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:02:48,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:49,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:02:49,160 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-10 04:02:49,162 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-10 04:02:49,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:49,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:49,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:49,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:02:49,183 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 23 treesize of output 18 [2018-11-10 04:02:49,186 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:02:49,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:02:49,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:49,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:49,200 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-10 04:02:49,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:02:49,203 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 13 [2018-11-10 04:02:49,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 04:02:49,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:49,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:49,207 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-10 04:02:49,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:02:49,220 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:02:49,220 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:02:49,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:49,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:02:49,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:02:49,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:02:49,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:02:49,226 INFO L87 Difference]: Start difference. First operand 399 states and 602 transitions. Second operand 7 states. [2018-11-10 04:02:52,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:52,084 INFO L93 Difference]: Finished difference Result 810 states and 1230 transitions. [2018-11-10 04:02:52,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:02:52,085 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2018-11-10 04:02:52,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:52,085 INFO L225 Difference]: With dead ends: 810 [2018-11-10 04:02:52,085 INFO L226 Difference]: Without dead ends: 462 [2018-11-10 04:02:52,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:02:52,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-11-10 04:02:52,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 399. [2018-11-10 04:02:52,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-11-10 04:02:52,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 601 transitions. [2018-11-10 04:02:52,104 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 601 transitions. Word has length 118 [2018-11-10 04:02:52,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:52,105 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 601 transitions. [2018-11-10 04:02:52,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:02:52,105 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 601 transitions. [2018-11-10 04:02:52,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 04:02:52,105 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:52,106 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:02:52,106 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:52,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:52,106 INFO L82 PathProgramCache]: Analyzing trace with hash 2067429233, now seen corresponding path program 1 times [2018-11-10 04:02:52,107 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:02:52,107 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 66 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 66 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:02:52,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:53,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:02:53,318 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-10 04:02:53,320 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-10 04:02:53,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:53,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:53,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:53,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:02:53,340 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 23 treesize of output 18 [2018-11-10 04:02:53,343 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:02:53,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:02:53,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:53,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:53,357 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-10 04:02:53,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:02:53,360 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 15 [2018-11-10 04:02:53,362 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 3 [2018-11-10 04:02:53,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:53,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:53,367 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-10 04:02:53,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 04:02:53,382 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 04:02:53,382 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:02:53,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:53,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:02:53,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:02:53,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:02:53,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:02:53,386 INFO L87 Difference]: Start difference. First operand 399 states and 601 transitions. Second operand 7 states. [2018-11-10 04:02:56,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:56,210 INFO L93 Difference]: Finished difference Result 800 states and 1216 transitions. [2018-11-10 04:02:56,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:02:56,210 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-11-10 04:02:56,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:56,211 INFO L225 Difference]: With dead ends: 800 [2018-11-10 04:02:56,211 INFO L226 Difference]: Without dead ends: 452 [2018-11-10 04:02:56,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:02:56,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-11-10 04:02:56,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 399. [2018-11-10 04:02:56,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-11-10 04:02:56,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 600 transitions. [2018-11-10 04:02:56,233 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 600 transitions. Word has length 119 [2018-11-10 04:02:56,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:56,233 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 600 transitions. [2018-11-10 04:02:56,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:02:56,234 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 600 transitions. [2018-11-10 04:02:56,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 04:02:56,234 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:56,234 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 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-10 04:02:56,234 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:56,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:56,235 INFO L82 PathProgramCache]: Analyzing trace with hash -131347132, now seen corresponding path program 1 times [2018-11-10 04:02:56,235 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:02:56,235 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 67 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 67 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:02:56,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:57,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:02:57,375 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-10 04:02:57,377 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-10 04:02:57,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:57,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:57,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:57,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:02:57,402 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 23 treesize of output 18 [2018-11-10 04:02:57,406 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:02:57,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 18 treesize of output 27 [2018-11-10 04:02:57,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:57,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:57,421 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-10 04:02:57,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:02:57,424 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 13 [2018-11-10 04:02:57,426 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-10 04:02:57,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:57,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:57,428 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-10 04:02:57,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:02:57,442 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:02:57,442 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:02:57,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:57,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:02:57,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:02:57,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:02:57,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:02:57,448 INFO L87 Difference]: Start difference. First operand 399 states and 600 transitions. Second operand 7 states. [2018-11-10 04:02:58,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:58,254 INFO L93 Difference]: Finished difference Result 800 states and 1214 transitions. [2018-11-10 04:02:58,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:02:58,254 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-11-10 04:02:58,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:58,255 INFO L225 Difference]: With dead ends: 800 [2018-11-10 04:02:58,256 INFO L226 Difference]: Without dead ends: 452 [2018-11-10 04:02:58,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:02:58,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-11-10 04:02:58,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 399. [2018-11-10 04:02:58,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-11-10 04:02:58,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 599 transitions. [2018-11-10 04:02:58,278 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 599 transitions. Word has length 119 [2018-11-10 04:02:58,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:58,278 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 599 transitions. [2018-11-10 04:02:58,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:02:58,278 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 599 transitions. [2018-11-10 04:02:58,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 04:02:58,279 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:58,279 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:02:58,279 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:58,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:58,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1701555508, now seen corresponding path program 1 times [2018-11-10 04:02:58,280 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:02:58,280 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 68 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 68 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:02:58,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:59,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:02:59,385 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-10 04:02:59,386 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-10 04:02:59,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:59,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:59,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:59,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:02:59,406 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 23 treesize of output 18 [2018-11-10 04:02:59,409 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:02:59,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:02:59,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:59,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:59,423 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-10 04:02:59,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:02:59,426 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 13 [2018-11-10 04:02:59,427 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-10 04:02:59,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:02:59,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:02:59,429 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-10 04:02:59,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:02:59,443 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:02:59,444 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:02:59,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:59,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:02:59,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:02:59,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:02:59,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:02:59,448 INFO L87 Difference]: Start difference. First operand 399 states and 599 transitions. Second operand 7 states. [2018-11-10 04:03:02,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:03:02,281 INFO L93 Difference]: Finished difference Result 798 states and 1210 transitions. [2018-11-10 04:03:02,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:03:02,281 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-11-10 04:03:02,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:03:02,282 INFO L225 Difference]: With dead ends: 798 [2018-11-10 04:03:02,282 INFO L226 Difference]: Without dead ends: 450 [2018-11-10 04:03:02,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:03:02,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-11-10 04:03:02,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 399. [2018-11-10 04:03:02,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-11-10 04:03:02,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 598 transitions. [2018-11-10 04:03:02,302 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 598 transitions. Word has length 119 [2018-11-10 04:03:02,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:03:02,302 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 598 transitions. [2018-11-10 04:03:02,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:03:02,302 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 598 transitions. [2018-11-10 04:03:02,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 04:03:02,302 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:03:02,302 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:03:02,303 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:03:02,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:03:02,303 INFO L82 PathProgramCache]: Analyzing trace with hash -319080273, now seen corresponding path program 1 times [2018-11-10 04:03:02,303 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:03:02,303 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 69 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 69 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:03:02,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:03:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:03:03,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:03:03,547 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-10 04:03:03,548 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-10 04:03:03,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:03,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:03,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:03,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:03:03,569 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 23 treesize of output 18 [2018-11-10 04:03:03,572 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:03:03,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:03:03,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:03,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:03,587 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-10 04:03:03,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:03:03,589 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 15 [2018-11-10 04:03:03,591 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 3 [2018-11-10 04:03:03,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:03,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:03,595 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-10 04:03:03,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 04:03:03,608 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 04:03:03,608 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:03:03,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:03:03,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:03:03,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:03:03,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:03:03,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:03:03,613 INFO L87 Difference]: Start difference. First operand 399 states and 598 transitions. Second operand 7 states. [2018-11-10 04:03:06,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:03:06,410 INFO L93 Difference]: Finished difference Result 760 states and 1151 transitions. [2018-11-10 04:03:06,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:03:06,410 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-11-10 04:03:06,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:03:06,411 INFO L225 Difference]: With dead ends: 760 [2018-11-10 04:03:06,411 INFO L226 Difference]: Without dead ends: 412 [2018-11-10 04:03:06,411 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:03:06,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-11-10 04:03:06,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 399. [2018-11-10 04:03:06,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-11-10 04:03:06,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 597 transitions. [2018-11-10 04:03:06,431 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 597 transitions. Word has length 119 [2018-11-10 04:03:06,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:03:06,431 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 597 transitions. [2018-11-10 04:03:06,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:03:06,431 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 597 transitions. [2018-11-10 04:03:06,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 04:03:06,431 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:03:06,431 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 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-10 04:03:06,432 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:03:06,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:03:06,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1130069586, now seen corresponding path program 1 times [2018-11-10 04:03:06,432 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:03:06,432 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 70 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 70 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:03:06,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:03:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:03:07,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:03:07,578 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-10 04:03:07,579 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-10 04:03:07,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:07,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:07,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:07,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:03:07,603 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 23 treesize of output 18 [2018-11-10 04:03:07,606 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:03:07,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:03:07,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:07,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:07,621 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-10 04:03:07,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:03:07,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 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 13 [2018-11-10 04:03:07,625 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-10 04:03:07,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:07,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:07,627 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-10 04:03:07,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:03:07,641 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:03:07,641 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:03:07,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:03:07,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:03:07,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:03:07,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:03:07,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:03:07,646 INFO L87 Difference]: Start difference. First operand 399 states and 597 transitions. Second operand 7 states. [2018-11-10 04:03:10,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:03:10,481 INFO L93 Difference]: Finished difference Result 796 states and 1203 transitions. [2018-11-10 04:03:10,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:03:10,481 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2018-11-10 04:03:10,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:03:10,482 INFO L225 Difference]: With dead ends: 796 [2018-11-10 04:03:10,482 INFO L226 Difference]: Without dead ends: 448 [2018-11-10 04:03:10,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:03:10,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-11-10 04:03:10,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 399. [2018-11-10 04:03:10,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-11-10 04:03:10,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 596 transitions. [2018-11-10 04:03:10,518 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 596 transitions. Word has length 120 [2018-11-10 04:03:10,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:03:10,518 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 596 transitions. [2018-11-10 04:03:10,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:03:10,519 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 596 transitions. [2018-11-10 04:03:10,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 04:03:10,519 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:03:10,519 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:03:10,520 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:03:10,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:03:10,520 INFO L82 PathProgramCache]: Analyzing trace with hash 782549528, now seen corresponding path program 1 times [2018-11-10 04:03:10,520 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:03:10,521 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 71 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 71 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:03:10,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:03:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:03:11,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:03:11,623 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-10 04:03:11,625 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-10 04:03:11,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:11,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:11,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:11,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:03:11,646 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 23 treesize of output 18 [2018-11-10 04:03:11,649 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:03:11,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:03:11,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:11,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:11,664 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-10 04:03:11,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:03:11,667 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 13 [2018-11-10 04:03:11,668 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-10 04:03:11,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:11,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:11,670 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-10 04:03:11,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:03:11,686 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:03:11,686 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:03:11,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:03:11,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:03:11,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:03:11,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:03:11,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:03:11,690 INFO L87 Difference]: Start difference. First operand 399 states and 596 transitions. Second operand 7 states. [2018-11-10 04:03:14,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:03:14,517 INFO L93 Difference]: Finished difference Result 793 states and 1197 transitions. [2018-11-10 04:03:14,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:03:14,518 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2018-11-10 04:03:14,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:03:14,518 INFO L225 Difference]: With dead ends: 793 [2018-11-10 04:03:14,518 INFO L226 Difference]: Without dead ends: 445 [2018-11-10 04:03:14,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:03:14,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-11-10 04:03:14,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 399. [2018-11-10 04:03:14,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-11-10 04:03:14,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 595 transitions. [2018-11-10 04:03:14,538 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 595 transitions. Word has length 120 [2018-11-10 04:03:14,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:03:14,538 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 595 transitions. [2018-11-10 04:03:14,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:03:14,538 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 595 transitions. [2018-11-10 04:03:14,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 04:03:14,539 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:03:14,539 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 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-10 04:03:14,539 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:03:14,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:03:14,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1125001675, now seen corresponding path program 1 times [2018-11-10 04:03:14,540 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:03:14,540 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 72 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 72 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:03:14,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:03:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:03:14,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:03:14,692 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:03:14,692 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:03:14,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:03:14,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:03:14,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:03:14,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:03:14,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:03:14,695 INFO L87 Difference]: Start difference. First operand 399 states and 595 transitions. Second operand 3 states. [2018-11-10 04:03:14,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:03:14,764 INFO L93 Difference]: Finished difference Result 1090 states and 1653 transitions. [2018-11-10 04:03:14,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:03:14,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2018-11-10 04:03:14,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:03:14,765 INFO L225 Difference]: With dead ends: 1090 [2018-11-10 04:03:14,765 INFO L226 Difference]: Without dead ends: 742 [2018-11-10 04:03:14,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 120 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-10 04:03:14,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2018-11-10 04:03:14,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 740. [2018-11-10 04:03:14,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2018-11-10 04:03:14,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1105 transitions. [2018-11-10 04:03:14,806 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1105 transitions. Word has length 122 [2018-11-10 04:03:14,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:03:14,806 INFO L481 AbstractCegarLoop]: Abstraction has 740 states and 1105 transitions. [2018-11-10 04:03:14,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:03:14,806 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1105 transitions. [2018-11-10 04:03:14,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 04:03:14,807 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:03:14,807 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 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-10 04:03:14,807 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:03:14,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:03:14,808 INFO L82 PathProgramCache]: Analyzing trace with hash -701354953, now seen corresponding path program 1 times [2018-11-10 04:03:14,808 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:03:14,808 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 73 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 73 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:03:14,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:03:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:03:16,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:03:16,026 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-10 04:03:16,028 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-10 04:03:16,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:16,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:16,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:16,037 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:03:16,050 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 23 treesize of output 18 [2018-11-10 04:03:16,053 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:03:16,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:03:16,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:16,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:16,067 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-10 04:03:16,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:03:16,070 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 13 [2018-11-10 04:03:16,071 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-10 04:03:16,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:16,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:16,073 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-10 04:03:16,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:03:16,090 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:03:16,090 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:03:16,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:03:16,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:03:16,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:03:16,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:03:16,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:03:16,096 INFO L87 Difference]: Start difference. First operand 740 states and 1105 transitions. Second operand 7 states. [2018-11-10 04:03:16,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:03:16,927 INFO L93 Difference]: Finished difference Result 1520 states and 2271 transitions. [2018-11-10 04:03:16,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:03:16,928 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 122 [2018-11-10 04:03:16,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:03:16,929 INFO L225 Difference]: With dead ends: 1520 [2018-11-10 04:03:16,929 INFO L226 Difference]: Without dead ends: 831 [2018-11-10 04:03:16,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:03:16,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-11-10 04:03:16,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 740. [2018-11-10 04:03:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2018-11-10 04:03:16,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1103 transitions. [2018-11-10 04:03:16,966 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1103 transitions. Word has length 122 [2018-11-10 04:03:16,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:03:16,966 INFO L481 AbstractCegarLoop]: Abstraction has 740 states and 1103 transitions. [2018-11-10 04:03:16,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:03:16,966 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1103 transitions. [2018-11-10 04:03:16,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 04:03:16,967 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:03:16,967 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 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-10 04:03:16,967 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:03:16,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:03:16,968 INFO L82 PathProgramCache]: Analyzing trace with hash 2009359305, now seen corresponding path program 1 times [2018-11-10 04:03:16,968 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:03:16,968 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 74 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 74 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:03:16,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:03:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:03:18,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:03:18,197 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-10 04:03:18,199 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-10 04:03:18,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:18,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:18,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:18,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:03:18,220 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 23 treesize of output 18 [2018-11-10 04:03:18,224 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:03:18,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:03:18,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:18,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:18,239 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-10 04:03:18,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:03:18,243 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 13 [2018-11-10 04:03:18,244 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-10 04:03:18,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:18,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:18,246 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-10 04:03:18,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:03:18,261 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:03:18,261 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:03:18,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:03:18,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:03:18,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:03:18,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:03:18,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:03:18,267 INFO L87 Difference]: Start difference. First operand 740 states and 1103 transitions. Second operand 7 states. [2018-11-10 04:03:21,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:03:21,112 INFO L93 Difference]: Finished difference Result 1504 states and 2241 transitions. [2018-11-10 04:03:21,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:03:21,113 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 123 [2018-11-10 04:03:21,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:03:21,114 INFO L225 Difference]: With dead ends: 1504 [2018-11-10 04:03:21,114 INFO L226 Difference]: Without dead ends: 815 [2018-11-10 04:03:21,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:03:21,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2018-11-10 04:03:21,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 740. [2018-11-10 04:03:21,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2018-11-10 04:03:21,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1101 transitions. [2018-11-10 04:03:21,153 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1101 transitions. Word has length 123 [2018-11-10 04:03:21,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:03:21,153 INFO L481 AbstractCegarLoop]: Abstraction has 740 states and 1101 transitions. [2018-11-10 04:03:21,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:03:21,153 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1101 transitions. [2018-11-10 04:03:21,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 04:03:21,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:03:21,154 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:03:21,154 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:03:21,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:03:21,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1656769892, now seen corresponding path program 1 times [2018-11-10 04:03:21,154 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:03:21,154 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 75 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 75 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:03:21,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:03:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:03:21,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:03:21,737 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-10 04:03:21,739 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-10 04:03:21,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:21,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:21,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:21,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:03:21,750 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 15 [2018-11-10 04:03:21,754 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 3 [2018-11-10 04:03:21,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:21,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:21,761 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-10 04:03:21,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:03:21,770 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 04:03:21,770 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:03:21,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:03:21,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:03:21,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:03:21,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:03:21,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:03:21,774 INFO L87 Difference]: Start difference. First operand 740 states and 1101 transitions. Second operand 4 states. [2018-11-10 04:03:24,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:03:24,248 INFO L93 Difference]: Finished difference Result 1521 states and 2270 transitions. [2018-11-10 04:03:24,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:03:24,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-11-10 04:03:24,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:03:24,250 INFO L225 Difference]: With dead ends: 1521 [2018-11-10 04:03:24,250 INFO L226 Difference]: Without dead ends: 832 [2018-11-10 04:03:24,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 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-10 04:03:24,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2018-11-10 04:03:24,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 772. [2018-11-10 04:03:24,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-11-10 04:03:24,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1153 transitions. [2018-11-10 04:03:24,291 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1153 transitions. Word has length 123 [2018-11-10 04:03:24,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:03:24,291 INFO L481 AbstractCegarLoop]: Abstraction has 772 states and 1153 transitions. [2018-11-10 04:03:24,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:03:24,292 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1153 transitions. [2018-11-10 04:03:24,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 04:03:24,293 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:03:24,293 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:03:24,293 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:03:24,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:03:24,293 INFO L82 PathProgramCache]: Analyzing trace with hash -680846036, now seen corresponding path program 1 times [2018-11-10 04:03:24,294 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:03:24,294 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 76 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 76 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:03:24,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:03:25,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:03:25,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:03:25,406 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-10 04:03:25,408 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-10 04:03:25,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:25,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:25,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:25,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:03:25,431 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 23 treesize of output 18 [2018-11-10 04:03:25,434 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:03:25,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:03:25,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:25,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:25,451 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-10 04:03:25,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:03:25,454 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 13 [2018-11-10 04:03:25,455 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-10 04:03:25,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:25,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:25,458 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-10 04:03:25,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:03:25,474 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:03:25,474 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:03:25,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:03:25,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:03:25,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:03:25,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:03:25,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:03:25,479 INFO L87 Difference]: Start difference. First operand 772 states and 1153 transitions. Second operand 7 states. [2018-11-10 04:03:26,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:03:26,280 INFO L93 Difference]: Finished difference Result 1568 states and 2341 transitions. [2018-11-10 04:03:26,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:03:26,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2018-11-10 04:03:26,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:03:26,281 INFO L225 Difference]: With dead ends: 1568 [2018-11-10 04:03:26,281 INFO L226 Difference]: Without dead ends: 847 [2018-11-10 04:03:26,281 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:03:26,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2018-11-10 04:03:26,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 772. [2018-11-10 04:03:26,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-11-10 04:03:26,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1151 transitions. [2018-11-10 04:03:26,319 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1151 transitions. Word has length 124 [2018-11-10 04:03:26,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:03:26,320 INFO L481 AbstractCegarLoop]: Abstraction has 772 states and 1151 transitions. [2018-11-10 04:03:26,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:03:26,320 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1151 transitions. [2018-11-10 04:03:26,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 04:03:26,320 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:03:26,320 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:03:26,321 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:03:26,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:03:26,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1263244253, now seen corresponding path program 1 times [2018-11-10 04:03:26,321 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:03:26,321 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 77 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 77 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:03:26,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:03:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:03:27,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:03:27,411 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-10 04:03:27,412 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-10 04:03:27,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:27,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:27,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:27,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:03:27,434 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 23 treesize of output 18 [2018-11-10 04:03:27,436 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:03:27,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 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:03:27,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:27,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:27,452 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-10 04:03:27,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:03:27,456 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 13 [2018-11-10 04:03:27,457 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-10 04:03:27,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:27,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:27,460 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-10 04:03:27,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:03:27,476 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:03:27,476 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:03:27,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:03:27,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:03:27,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:03:27,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:03:27,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:03:27,480 INFO L87 Difference]: Start difference. First operand 772 states and 1151 transitions. Second operand 7 states. [2018-11-10 04:03:30,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:03:30,316 INFO L93 Difference]: Finished difference Result 1562 states and 2330 transitions. [2018-11-10 04:03:30,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:03:30,316 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2018-11-10 04:03:30,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:03:30,317 INFO L225 Difference]: With dead ends: 1562 [2018-11-10 04:03:30,317 INFO L226 Difference]: Without dead ends: 841 [2018-11-10 04:03:30,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:03:30,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2018-11-10 04:03:30,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 772. [2018-11-10 04:03:30,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-11-10 04:03:30,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1149 transitions. [2018-11-10 04:03:30,355 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1149 transitions. Word has length 125 [2018-11-10 04:03:30,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:03:30,356 INFO L481 AbstractCegarLoop]: Abstraction has 772 states and 1149 transitions. [2018-11-10 04:03:30,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:03:30,356 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1149 transitions. [2018-11-10 04:03:30,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 04:03:30,356 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:03:30,356 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:03:30,357 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:03:30,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:03:30,357 INFO L82 PathProgramCache]: Analyzing trace with hash -824130532, now seen corresponding path program 1 times [2018-11-10 04:03:30,357 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:03:30,357 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 78 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 78 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:03:30,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:03:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:03:30,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:03:30,970 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-10 04:03:30,972 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-10 04:03:30,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:30,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:30,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:30,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:03:30,984 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 15 [2018-11-10 04:03:30,985 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 3 [2018-11-10 04:03:30,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:30,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:30,988 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-10 04:03:30,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:03:30,998 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 04:03:30,999 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:03:31,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:03:31,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:03:31,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:03:31,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:03:31,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:03:31,002 INFO L87 Difference]: Start difference. First operand 772 states and 1149 transitions. Second operand 4 states. [2018-11-10 04:03:33,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:03:33,648 INFO L93 Difference]: Finished difference Result 1678 states and 2512 transitions. [2018-11-10 04:03:33,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:03:33,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2018-11-10 04:03:33,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:03:33,649 INFO L225 Difference]: With dead ends: 1678 [2018-11-10 04:03:33,649 INFO L226 Difference]: Without dead ends: 957 [2018-11-10 04:03:33,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 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-10 04:03:33,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2018-11-10 04:03:33,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 844. [2018-11-10 04:03:33,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-11-10 04:03:33,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1275 transitions. [2018-11-10 04:03:33,690 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1275 transitions. Word has length 125 [2018-11-10 04:03:33,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:03:33,690 INFO L481 AbstractCegarLoop]: Abstraction has 844 states and 1275 transitions. [2018-11-10 04:03:33,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:03:33,691 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1275 transitions. [2018-11-10 04:03:33,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-10 04:03:33,691 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:03:33,691 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:03:33,692 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:03:33,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:03:33,692 INFO L82 PathProgramCache]: Analyzing trace with hash -341359932, now seen corresponding path program 1 times [2018-11-10 04:03:33,692 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:03:33,692 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 79 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 79 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:03:33,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:03:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:03:34,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:03:34,794 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-10 04:03:34,795 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-10 04:03:34,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:34,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:34,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:34,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:03:34,817 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 23 treesize of output 18 [2018-11-10 04:03:34,820 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:03:34,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:03:34,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:34,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:34,834 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-10 04:03:34,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:03:34,838 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 13 [2018-11-10 04:03:34,839 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-10 04:03:34,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:34,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:34,842 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-10 04:03:34,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:03:34,857 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:03:34,858 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:03:34,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:03:34,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:03:34,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:03:34,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:03:34,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:03:34,862 INFO L87 Difference]: Start difference. First operand 844 states and 1275 transitions. Second operand 7 states. [2018-11-10 04:03:37,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:03:37,707 INFO L93 Difference]: Finished difference Result 1706 states and 2578 transitions. [2018-11-10 04:03:37,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:03:37,707 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 126 [2018-11-10 04:03:37,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:03:37,708 INFO L225 Difference]: With dead ends: 1706 [2018-11-10 04:03:37,708 INFO L226 Difference]: Without dead ends: 913 [2018-11-10 04:03:37,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:03:37,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2018-11-10 04:03:37,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 844. [2018-11-10 04:03:37,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-11-10 04:03:37,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1273 transitions. [2018-11-10 04:03:37,749 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1273 transitions. Word has length 126 [2018-11-10 04:03:37,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:03:37,750 INFO L481 AbstractCegarLoop]: Abstraction has 844 states and 1273 transitions. [2018-11-10 04:03:37,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:03:37,750 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1273 transitions. [2018-11-10 04:03:37,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 04:03:37,750 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:03:37,751 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:03:37,751 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:03:37,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:03:37,751 INFO L82 PathProgramCache]: Analyzing trace with hash -457316197, now seen corresponding path program 1 times [2018-11-10 04:03:37,751 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:03:37,751 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 80 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 80 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:03:37,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:03:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:03:38,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:03:38,865 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-10 04:03:38,867 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-10 04:03:38,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:38,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:38,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:38,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:03:38,890 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 23 treesize of output 18 [2018-11-10 04:03:38,893 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:03:38,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:03:38,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:38,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:38,907 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-10 04:03:38,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:03:38,911 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 13 [2018-11-10 04:03:38,912 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-10 04:03:38,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:38,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:38,915 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-10 04:03:38,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:03:38,931 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:03:38,931 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:03:38,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:03:38,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:03:38,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:03:38,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:03:38,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:03:38,936 INFO L87 Difference]: Start difference. First operand 844 states and 1273 transitions. Second operand 7 states. [2018-11-10 04:03:41,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:03:41,797 INFO L93 Difference]: Finished difference Result 1700 states and 2567 transitions. [2018-11-10 04:03:41,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:03:41,798 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 127 [2018-11-10 04:03:41,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:03:41,799 INFO L225 Difference]: With dead ends: 1700 [2018-11-10 04:03:41,799 INFO L226 Difference]: Without dead ends: 907 [2018-11-10 04:03:41,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:03:41,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2018-11-10 04:03:41,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 844. [2018-11-10 04:03:41,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-11-10 04:03:41,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1271 transitions. [2018-11-10 04:03:41,841 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1271 transitions. Word has length 127 [2018-11-10 04:03:41,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:03:41,841 INFO L481 AbstractCegarLoop]: Abstraction has 844 states and 1271 transitions. [2018-11-10 04:03:41,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:03:41,841 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1271 transitions. [2018-11-10 04:03:41,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-10 04:03:41,842 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:03:41,843 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:03:41,843 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:03:41,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:03:41,843 INFO L82 PathProgramCache]: Analyzing trace with hash 2074930197, now seen corresponding path program 1 times [2018-11-10 04:03:41,843 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:03:41,843 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 81 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 81 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:03:41,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:03:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:03:43,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:03:43,160 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 18 treesize of output 15 [2018-11-10 04:03:43,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 04:03:43,165 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:03:43,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:03:43,167 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:43,173 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:43,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:43,185 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-10 04:03:43,185 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:03:43,197 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 15 [2018-11-10 04:03:43,198 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 3 [2018-11-10 04:03:43,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:43,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:43,202 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-10 04:03:43,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 04:03:43,223 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 04:03:43,224 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:03:43,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:03:43,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:03:43,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:03:43,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:03:43,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:03:43,229 INFO L87 Difference]: Start difference. First operand 844 states and 1271 transitions. Second operand 7 states. [2018-11-10 04:03:46,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:03:46,080 INFO L93 Difference]: Finished difference Result 1706 states and 2567 transitions. [2018-11-10 04:03:46,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:03:46,081 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 129 [2018-11-10 04:03:46,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:03:46,082 INFO L225 Difference]: With dead ends: 1706 [2018-11-10 04:03:46,082 INFO L226 Difference]: Without dead ends: 913 [2018-11-10 04:03:46,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:03:46,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2018-11-10 04:03:46,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 844. [2018-11-10 04:03:46,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-11-10 04:03:46,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1269 transitions. [2018-11-10 04:03:46,124 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1269 transitions. Word has length 129 [2018-11-10 04:03:46,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:03:46,124 INFO L481 AbstractCegarLoop]: Abstraction has 844 states and 1269 transitions. [2018-11-10 04:03:46,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:03:46,125 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1269 transitions. [2018-11-10 04:03:46,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 04:03:46,125 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:03:46,125 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:03:46,125 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:03:46,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:03:46,126 INFO L82 PathProgramCache]: Analyzing trace with hash -2110260847, now seen corresponding path program 1 times [2018-11-10 04:03:46,126 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:03:46,126 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 82 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 82 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:03:46,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:03:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:03:47,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:03:47,448 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 18 treesize of output 15 [2018-11-10 04:03:47,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 04:03:47,455 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:03:47,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:03:47,457 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:47,464 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:47,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:47,476 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-10 04:03:47,476 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:03:47,488 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 15 [2018-11-10 04:03:47,489 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 3 [2018-11-10 04:03:47,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:47,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:47,493 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-10 04:03:47,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 04:03:47,508 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 04:03:47,509 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:03:47,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:03:47,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:03:47,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:03:47,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:03:47,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:03:47,514 INFO L87 Difference]: Start difference. First operand 844 states and 1269 transitions. Second operand 7 states. [2018-11-10 04:03:48,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:03:48,382 INFO L93 Difference]: Finished difference Result 1706 states and 2563 transitions. [2018-11-10 04:03:48,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:03:48,383 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2018-11-10 04:03:48,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:03:48,384 INFO L225 Difference]: With dead ends: 1706 [2018-11-10 04:03:48,384 INFO L226 Difference]: Without dead ends: 913 [2018-11-10 04:03:48,384 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:03:48,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2018-11-10 04:03:48,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 844. [2018-11-10 04:03:48,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-11-10 04:03:48,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1267 transitions. [2018-11-10 04:03:48,431 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1267 transitions. Word has length 130 [2018-11-10 04:03:48,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:03:48,431 INFO L481 AbstractCegarLoop]: Abstraction has 844 states and 1267 transitions. [2018-11-10 04:03:48,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:03:48,431 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1267 transitions. [2018-11-10 04:03:48,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 04:03:48,432 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:03:48,432 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:03:48,432 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:03:48,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:03:48,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1845740784, now seen corresponding path program 1 times [2018-11-10 04:03:48,433 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:03:48,433 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 83 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 83 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:03:48,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:03:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:03:49,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:03:49,741 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 18 treesize of output 15 [2018-11-10 04:03:49,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 04:03:49,746 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:03:49,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:03:49,749 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:49,755 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:49,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:49,767 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-10 04:03:49,768 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:03:49,780 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 15 [2018-11-10 04:03:49,781 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 3 [2018-11-10 04:03:49,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:49,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:49,786 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-10 04:03:49,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 04:03:49,801 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 04:03:49,801 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:03:49,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:03:49,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:03:49,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:03:49,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:03:49,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:03:49,806 INFO L87 Difference]: Start difference. First operand 844 states and 1267 transitions. Second operand 7 states. [2018-11-10 04:03:50,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:03:50,650 INFO L93 Difference]: Finished difference Result 1706 states and 2559 transitions. [2018-11-10 04:03:50,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:03:50,650 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 131 [2018-11-10 04:03:50,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:03:50,651 INFO L225 Difference]: With dead ends: 1706 [2018-11-10 04:03:50,651 INFO L226 Difference]: Without dead ends: 913 [2018-11-10 04:03:50,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:03:50,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2018-11-10 04:03:50,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 844. [2018-11-10 04:03:50,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-11-10 04:03:50,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1265 transitions. [2018-11-10 04:03:50,694 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1265 transitions. Word has length 131 [2018-11-10 04:03:50,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:03:50,694 INFO L481 AbstractCegarLoop]: Abstraction has 844 states and 1265 transitions. [2018-11-10 04:03:50,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:03:50,694 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1265 transitions. [2018-11-10 04:03:50,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-10 04:03:50,695 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:03:50,695 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:03:50,695 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:03:50,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:03:50,696 INFO L82 PathProgramCache]: Analyzing trace with hash 480677580, now seen corresponding path program 1 times [2018-11-10 04:03:50,696 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:03:50,696 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 84 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 84 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:03:50,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:03:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:03:52,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:03:52,075 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 18 treesize of output 15 [2018-11-10 04:03:52,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 04:03:52,079 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:03:52,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:03:52,080 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:52,086 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:52,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:52,098 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-10 04:03:52,098 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:03:52,110 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 15 [2018-11-10 04:03:52,111 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 3 [2018-11-10 04:03:52,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:52,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:52,116 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-10 04:03:52,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 04:03:52,131 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 04:03:52,131 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:03:52,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:03:52,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:03:52,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:03:52,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:03:52,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:03:52,137 INFO L87 Difference]: Start difference. First operand 844 states and 1265 transitions. Second operand 7 states. [2018-11-10 04:03:54,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:03:54,984 INFO L93 Difference]: Finished difference Result 1686 states and 2529 transitions. [2018-11-10 04:03:54,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:03:54,985 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2018-11-10 04:03:54,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:03:54,986 INFO L225 Difference]: With dead ends: 1686 [2018-11-10 04:03:54,986 INFO L226 Difference]: Without dead ends: 893 [2018-11-10 04:03:54,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:03:54,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2018-11-10 04:03:55,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 844. [2018-11-10 04:03:55,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-11-10 04:03:55,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1263 transitions. [2018-11-10 04:03:55,033 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1263 transitions. Word has length 132 [2018-11-10 04:03:55,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:03:55,034 INFO L481 AbstractCegarLoop]: Abstraction has 844 states and 1263 transitions. [2018-11-10 04:03:55,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:03:55,034 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1263 transitions. [2018-11-10 04:03:55,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-10 04:03:55,035 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:03:55,035 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:03:55,035 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:03:55,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:03:55,036 INFO L82 PathProgramCache]: Analyzing trace with hash 149095944, now seen corresponding path program 1 times [2018-11-10 04:03:55,036 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:03:55,036 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 85 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 85 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:03:55,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:03:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:03:55,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:03:55,188 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 04:03:55,188 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:03:55,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:03:55,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:03:55,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:03:55,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:03:55,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:03:55,190 INFO L87 Difference]: Start difference. First operand 844 states and 1263 transitions. Second operand 3 states. [2018-11-10 04:03:55,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:03:55,263 INFO L93 Difference]: Finished difference Result 1688 states and 2533 transitions. [2018-11-10 04:03:55,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:03:55,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2018-11-10 04:03:55,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:03:55,267 INFO L225 Difference]: With dead ends: 1688 [2018-11-10 04:03:55,267 INFO L226 Difference]: Without dead ends: 895 [2018-11-10 04:03:55,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 130 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-10 04:03:55,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2018-11-10 04:03:55,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 895. [2018-11-10 04:03:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-11-10 04:03:55,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1331 transitions. [2018-11-10 04:03:55,313 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1331 transitions. Word has length 132 [2018-11-10 04:03:55,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:03:55,313 INFO L481 AbstractCegarLoop]: Abstraction has 895 states and 1331 transitions. [2018-11-10 04:03:55,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:03:55,313 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1331 transitions. [2018-11-10 04:03:55,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-10 04:03:55,314 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:03:55,314 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:03:55,314 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:03:55,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:03:55,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1666771433, now seen corresponding path program 1 times [2018-11-10 04:03:55,315 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:03:55,315 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 86 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 86 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:03:55,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:03:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:03:56,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:03:56,617 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 18 treesize of output 15 [2018-11-10 04:03:56,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 04:03:56,622 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:03:56,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:03:56,625 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:56,631 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:56,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:56,643 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-10 04:03:56,643 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:03:56,656 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 13 [2018-11-10 04:03:56,657 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-10 04:03:56,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:56,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:03:56,660 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-10 04:03:56,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:03:56,678 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 64 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 04:03:56,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:03:56,698 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 04:03:56,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 04:03:56,699 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-10 04:03:56,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-10 04:03:56,716 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 04:03:56,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:03:56,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 04:03:56,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 04:03:56,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 04:03:56,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 04:03:56,721 INFO L87 Difference]: Start difference. First operand 895 states and 1331 transitions. Second operand 9 states. [2018-11-10 04:04:00,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:04:00,357 INFO L93 Difference]: Finished difference Result 2249 states and 3355 transitions. [2018-11-10 04:04:00,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 04:04:00,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2018-11-10 04:04:00,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:04:00,359 INFO L225 Difference]: With dead ends: 2249 [2018-11-10 04:04:00,359 INFO L226 Difference]: Without dead ends: 1405 [2018-11-10 04:04:00,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 04:04:00,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2018-11-10 04:04:00,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 977. [2018-11-10 04:04:00,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2018-11-10 04:04:00,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1475 transitions. [2018-11-10 04:04:00,410 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1475 transitions. Word has length 133 [2018-11-10 04:04:00,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:04:00,411 INFO L481 AbstractCegarLoop]: Abstraction has 977 states and 1475 transitions. [2018-11-10 04:04:00,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 04:04:00,411 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1475 transitions. [2018-11-10 04:04:00,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-10 04:04:00,412 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:04:00,412 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:04:00,412 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:04:00,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:04:00,412 INFO L82 PathProgramCache]: Analyzing trace with hash -109965874, now seen corresponding path program 1 times [2018-11-10 04:04:00,413 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:04:00,413 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 87 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 87 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:04:00,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:04:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:04:01,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:04:01,702 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 18 treesize of output 15 [2018-11-10 04:04:01,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 04:04:01,707 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:04:01,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:04:01,709 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:01,715 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:01,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:01,729 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-10 04:04:01,729 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:04:01,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 17 treesize of output 13 [2018-11-10 04:04:01,742 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-10 04:04:01,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:01,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:01,745 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-10 04:04:01,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:04:01,769 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 65 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 04:04:01,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:04:01,789 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 04:04:01,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:01,793 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-10 04:04:01,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-10 04:04:01,812 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 04:04:01,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:04:01,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 04:04:01,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 04:04:01,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 04:04:01,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 04:04:01,819 INFO L87 Difference]: Start difference. First operand 977 states and 1475 transitions. Second operand 9 states. [2018-11-10 04:04:05,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:04:05,277 INFO L93 Difference]: Finished difference Result 2365 states and 3571 transitions. [2018-11-10 04:04:05,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 04:04:05,277 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2018-11-10 04:04:05,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:04:05,279 INFO L225 Difference]: With dead ends: 2365 [2018-11-10 04:04:05,279 INFO L226 Difference]: Without dead ends: 1439 [2018-11-10 04:04:05,280 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 04:04:05,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2018-11-10 04:04:05,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1019. [2018-11-10 04:04:05,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2018-11-10 04:04:05,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1561 transitions. [2018-11-10 04:04:05,332 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1561 transitions. Word has length 134 [2018-11-10 04:04:05,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:04:05,333 INFO L481 AbstractCegarLoop]: Abstraction has 1019 states and 1561 transitions. [2018-11-10 04:04:05,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 04:04:05,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1561 transitions. [2018-11-10 04:04:05,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-10 04:04:05,333 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:04:05,334 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:04:05,334 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:04:05,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:04:05,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1676845348, now seen corresponding path program 1 times [2018-11-10 04:04:05,334 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:04:05,334 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 88 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 88 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:04:05,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:04:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:04:06,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:04:06,606 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-10 04:04:06,608 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-10 04:04:06,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:06,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:06,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:06,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:04:06,627 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 23 treesize of output 18 [2018-11-10 04:04:06,630 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:04:06,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:04:06,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:06,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:06,645 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-10 04:04:06,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:04:06,672 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:04:06,672 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:04:06,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:04:06,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:04:06,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:04:06,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:04:06,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:04:06,677 INFO L87 Difference]: Start difference. First operand 1019 states and 1561 transitions. Second operand 7 states. [2018-11-10 04:04:07,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:04:07,424 INFO L93 Difference]: Finished difference Result 2041 states and 3128 transitions. [2018-11-10 04:04:07,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:04:07,425 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 135 [2018-11-10 04:04:07,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:04:07,425 INFO L225 Difference]: With dead ends: 2041 [2018-11-10 04:04:07,425 INFO L226 Difference]: Without dead ends: 1073 [2018-11-10 04:04:07,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:04:07,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2018-11-10 04:04:07,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1025. [2018-11-10 04:04:07,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1025 states. [2018-11-10 04:04:07,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1567 transitions. [2018-11-10 04:04:07,477 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1567 transitions. Word has length 135 [2018-11-10 04:04:07,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:04:07,477 INFO L481 AbstractCegarLoop]: Abstraction has 1025 states and 1567 transitions. [2018-11-10 04:04:07,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:04:07,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1567 transitions. [2018-11-10 04:04:07,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-10 04:04:07,478 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:04:07,479 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:04:07,479 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:04:07,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:04:07,479 INFO L82 PathProgramCache]: Analyzing trace with hash 310985188, now seen corresponding path program 1 times [2018-11-10 04:04:07,479 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:04:07,479 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 89 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 89 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:04:07,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:04:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:04:08,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:04:08,240 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-10 04:04:08,242 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-10 04:04:08,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:08,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:08,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:08,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:04:08,260 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 15 [2018-11-10 04:04:08,262 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 3 [2018-11-10 04:04:08,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:08,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:08,267 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-10 04:04:08,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:04:08,281 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 04:04:08,281 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:04:08,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:04:08,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:04:08,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:04:08,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:04:08,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:04:08,286 INFO L87 Difference]: Start difference. First operand 1025 states and 1567 transitions. Second operand 4 states. [2018-11-10 04:04:10,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:04:10,954 INFO L93 Difference]: Finished difference Result 2107 states and 3213 transitions. [2018-11-10 04:04:10,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:04:10,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-11-10 04:04:10,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:04:10,955 INFO L225 Difference]: With dead ends: 2107 [2018-11-10 04:04:10,955 INFO L226 Difference]: Without dead ends: 1133 [2018-11-10 04:04:10,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 152 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-10 04:04:10,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2018-11-10 04:04:11,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1025. [2018-11-10 04:04:11,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1025 states. [2018-11-10 04:04:11,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1565 transitions. [2018-11-10 04:04:11,017 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1565 transitions. Word has length 155 [2018-11-10 04:04:11,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:04:11,017 INFO L481 AbstractCegarLoop]: Abstraction has 1025 states and 1565 transitions. [2018-11-10 04:04:11,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:04:11,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1565 transitions. [2018-11-10 04:04:11,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-10 04:04:11,018 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:04:11,018 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:04:11,018 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:04:11,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:04:11,019 INFO L82 PathProgramCache]: Analyzing trace with hash -396688655, now seen corresponding path program 1 times [2018-11-10 04:04:11,019 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:04:11,019 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 90 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 90 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:04:11,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:04:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:04:12,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:04:12,736 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 18 treesize of output 15 [2018-11-10 04:04:12,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 04:04:12,741 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:04:12,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:04:12,743 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:12,749 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:12,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:12,761 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-10 04:04:12,761 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:04:12,772 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 13 [2018-11-10 04:04:12,773 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-10 04:04:12,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:12,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:12,776 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-10 04:04:12,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:04:12,797 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 150 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 04:04:12,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:04:12,817 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 04:04:12,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:12,818 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-10 04:04:12,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-10 04:04:12,835 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 04:04:12,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:04:12,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 04:04:12,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 04:04:12,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 04:04:12,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 04:04:12,841 INFO L87 Difference]: Start difference. First operand 1025 states and 1565 transitions. Second operand 9 states. [2018-11-10 04:04:16,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:04:16,263 INFO L93 Difference]: Finished difference Result 2565 states and 3929 transitions. [2018-11-10 04:04:16,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 04:04:16,263 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 163 [2018-11-10 04:04:16,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:04:16,265 INFO L225 Difference]: With dead ends: 2565 [2018-11-10 04:04:16,265 INFO L226 Difference]: Without dead ends: 1591 [2018-11-10 04:04:16,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 04:04:16,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-11-10 04:04:16,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1157. [2018-11-10 04:04:16,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2018-11-10 04:04:16,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1793 transitions. [2018-11-10 04:04:16,321 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1793 transitions. Word has length 163 [2018-11-10 04:04:16,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:04:16,321 INFO L481 AbstractCegarLoop]: Abstraction has 1157 states and 1793 transitions. [2018-11-10 04:04:16,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 04:04:16,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1793 transitions. [2018-11-10 04:04:16,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-10 04:04:16,323 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:04:16,323 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:04:16,323 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:04:16,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:04:16,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1792392413, now seen corresponding path program 1 times [2018-11-10 04:04:16,323 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:04:16,323 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 91 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 91 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:04:16,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:04:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:04:17,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:04:17,983 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 18 treesize of output 15 [2018-11-10 04:04:17,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 04:04:17,987 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:04:17,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:04:17,990 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:17,995 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:17,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:18,006 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-10 04:04:18,006 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:04:18,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 17 treesize of output 13 [2018-11-10 04:04:18,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 13 treesize of output 5 [2018-11-10 04:04:18,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:18,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:18,022 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-10 04:04:18,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:04:18,045 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 160 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 04:04:18,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:04:18,066 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 04:04:18,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:18,066 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-10 04:04:18,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-10 04:04:18,081 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 04:04:18,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:04:18,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 04:04:18,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 04:04:18,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 04:04:18,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 04:04:18,087 INFO L87 Difference]: Start difference. First operand 1157 states and 1793 transitions. Second operand 9 states. [2018-11-10 04:04:21,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:04:21,558 INFO L93 Difference]: Finished difference Result 2755 states and 4245 transitions. [2018-11-10 04:04:21,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 04:04:21,559 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 169 [2018-11-10 04:04:21,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:04:21,560 INFO L225 Difference]: With dead ends: 2755 [2018-11-10 04:04:21,560 INFO L226 Difference]: Without dead ends: 1649 [2018-11-10 04:04:21,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 04:04:21,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2018-11-10 04:04:21,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1233. [2018-11-10 04:04:21,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2018-11-10 04:04:21,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1923 transitions. [2018-11-10 04:04:21,620 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1923 transitions. Word has length 169 [2018-11-10 04:04:21,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:04:21,620 INFO L481 AbstractCegarLoop]: Abstraction has 1233 states and 1923 transitions. [2018-11-10 04:04:21,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 04:04:21,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1923 transitions. [2018-11-10 04:04:21,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-10 04:04:21,621 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:04:21,621 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:04:21,621 INFO L424 AbstractCegarLoop]: === Iteration 91 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:04:21,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:04:21,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1264497058, now seen corresponding path program 1 times [2018-11-10 04:04:21,622 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:04:21,622 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 92 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 92 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:04:21,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:04:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:04:23,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:04:23,338 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 18 treesize of output 15 [2018-11-10 04:04:23,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 04:04:23,343 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:04:23,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:04:23,347 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:23,353 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:23,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:23,366 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-10 04:04:23,366 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:04:23,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, 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 13 [2018-11-10 04:04:23,380 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-10 04:04:23,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:23,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:23,383 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-10 04:04:23,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:04:23,406 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 162 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 04:04:23,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:04:23,426 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 04:04:23,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:23,426 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-10 04:04:23,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 04:04:23,449 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 04:04:23,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:04:23,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 04:04:23,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 04:04:23,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 04:04:23,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 04:04:23,455 INFO L87 Difference]: Start difference. First operand 1233 states and 1923 transitions. Second operand 9 states. [2018-11-10 04:04:26,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:04:26,899 INFO L93 Difference]: Finished difference Result 2819 states and 4354 transitions. [2018-11-10 04:04:26,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 04:04:26,899 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 170 [2018-11-10 04:04:26,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:04:26,901 INFO L225 Difference]: With dead ends: 2819 [2018-11-10 04:04:26,901 INFO L226 Difference]: Without dead ends: 1637 [2018-11-10 04:04:26,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 04:04:26,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2018-11-10 04:04:26,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1233. [2018-11-10 04:04:26,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2018-11-10 04:04:26,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1919 transitions. [2018-11-10 04:04:26,963 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1919 transitions. Word has length 170 [2018-11-10 04:04:26,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:04:26,963 INFO L481 AbstractCegarLoop]: Abstraction has 1233 states and 1919 transitions. [2018-11-10 04:04:26,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 04:04:26,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1919 transitions. [2018-11-10 04:04:26,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-10 04:04:26,964 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:04:26,964 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:04:26,964 INFO L424 AbstractCegarLoop]: === Iteration 92 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:04:26,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:04:26,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1610277282, now seen corresponding path program 1 times [2018-11-10 04:04:26,965 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:04:26,965 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 93 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 93 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:04:26,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:04:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:04:28,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:04:28,979 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 18 treesize of output 15 [2018-11-10 04:04:28,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 04:04:28,983 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:04:28,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:04:28,986 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:28,991 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:28,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:29,003 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-10 04:04:29,004 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:04:29,015 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 15 [2018-11-10 04:04:29,018 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 3 [2018-11-10 04:04:29,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:29,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:29,026 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-10 04:04:29,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 04:04:29,045 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 04:04:29,045 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:04:29,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:04:29,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:04:29,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:04:29,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:04:29,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:04:29,051 INFO L87 Difference]: Start difference. First operand 1233 states and 1919 transitions. Second operand 7 states. [2018-11-10 04:04:31,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:04:31,947 INFO L93 Difference]: Finished difference Result 2445 states and 3814 transitions. [2018-11-10 04:04:31,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:04:31,948 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 172 [2018-11-10 04:04:31,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:04:31,949 INFO L225 Difference]: With dead ends: 2445 [2018-11-10 04:04:31,949 INFO L226 Difference]: Without dead ends: 1263 [2018-11-10 04:04:31,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:04:31,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2018-11-10 04:04:32,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1233. [2018-11-10 04:04:32,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2018-11-10 04:04:32,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1917 transitions. [2018-11-10 04:04:32,013 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1917 transitions. Word has length 172 [2018-11-10 04:04:32,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:04:32,014 INFO L481 AbstractCegarLoop]: Abstraction has 1233 states and 1917 transitions. [2018-11-10 04:04:32,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:04:32,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1917 transitions. [2018-11-10 04:04:32,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 04:04:32,015 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:04:32,015 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:04:32,016 INFO L424 AbstractCegarLoop]: === Iteration 93 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:04:32,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:04:32,016 INFO L82 PathProgramCache]: Analyzing trace with hash -208047317, now seen corresponding path program 1 times [2018-11-10 04:04:32,016 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:04:32,017 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 94 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 94 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:04:32,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:04:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:04:35,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:04:35,114 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:04:35,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 32 [2018-11-10 04:04:35,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-10 04:04:35,142 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:04:35,146 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:04:35,151 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:04:35,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2018-11-10 04:04:35,151 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:35,186 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:35,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:35,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-10 04:04:35,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 20 treesize of output 23 [2018-11-10 04:04:35,305 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:04:35,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 04:04:35,311 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:04:35,313 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:04:35,314 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:04:35,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 04:04:35,317 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:35,328 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:35,337 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:35,345 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:35,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 13 treesize of output 10 [2018-11-10 04:04:35,379 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-10 04:04:35,379 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:35,396 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:35,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:35,418 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:62, output treesize:65 [2018-11-10 04:04:35,502 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:04:35,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 76 [2018-11-10 04:04:35,517 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 22 treesize of output 21 [2018-11-10 04:04:35,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:35,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:35,562 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-10 04:04:35,566 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:04:35,566 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 25 treesize of output 19 [2018-11-10 04:04:35,567 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:35,573 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:35,590 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-10 04:04:35,590 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:82, output treesize:46 [2018-11-10 04:04:35,627 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 15 treesize of output 12 [2018-11-10 04:04:35,630 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 12 treesize of output 1 [2018-11-10 04:04:35,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:35,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:35,641 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-10 04:04:35,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:46 [2018-11-10 04:04:35,649 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-10 04:04:35,652 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-10 04:04:35,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:35,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:35,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:35,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2018-11-10 04:04:35,710 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:04:35,722 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 33 treesize of output 34 [2018-11-10 04:04:35,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-10 04:04:35,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:35,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:35,781 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 33 treesize of output 24 [2018-11-10 04:04:35,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2018-11-10 04:04:35,786 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:35,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:35,816 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 56 treesize of output 42 [2018-11-10 04:04:35,820 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:04:35,821 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:04:35,822 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:04:35,823 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:04:35,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 46 [2018-11-10 04:04:35,828 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 04:04:35,836 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 04:04:35,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:35,845 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:111, output treesize:13 [2018-11-10 04:04:35,867 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 23 treesize of output 18 [2018-11-10 04:04:35,869 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:04:35,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:04:35,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:35,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:35,884 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-10 04:04:35,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:04:35,887 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 13 [2018-11-10 04:04:35,888 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-10 04:04:35,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:35,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:35,890 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-10 04:04:35,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:04:36,003 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 04:04:36,003 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:04:36,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-11-10 04:04:36,080 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 25 treesize of output 1 [2018-11-10 04:04:36,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:36,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:36,094 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-10 04:04:36,094 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:32 [2018-11-10 04:04:36,168 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 52 treesize of output 44 [2018-11-10 04:04:36,210 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-10 04:04:36,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:36,228 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 10 treesize of output 8 [2018-11-10 04:04:36,232 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-10 04:04:36,232 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:36,235 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:36,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:36,258 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-10 04:04:36,259 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:10 [2018-11-10 04:04:36,297 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 16 treesize of output 13 [2018-11-10 04:04:36,300 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 13 treesize of output 1 [2018-11-10 04:04:36,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:36,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:36,307 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-10 04:04:36,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:10 [2018-11-10 04:04:36,605 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 04:04:36,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:04:36,611 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:04:36,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:04:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:04:36,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:04:36,956 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 5 treesize of output 1 [2018-11-10 04:04:36,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:37,006 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-10 04:04:37,009 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-10 04:04:37,009 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:37,014 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:37,042 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 23 treesize of output 20 [2018-11-10 04:04:37,044 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 04:04:37,048 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:04:37,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 04:04:37,054 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:04:37,056 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:04:37,057 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:04:37,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 04:04:37,063 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:37,078 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:37,088 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:37,095 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:37,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:37,113 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:48, output treesize:23 [2018-11-10 04:04:37,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 40 [2018-11-10 04:04:37,239 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 29 treesize of output 28 [2018-11-10 04:04:37,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:37,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:37,290 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-10 04:04:37,293 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:04:37,293 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 19 treesize of output 13 [2018-11-10 04:04:37,293 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:37,297 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:37,304 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-10 04:04:37,305 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:12 [2018-11-10 04:04:37,340 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-10 04:04:37,342 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-10 04:04:37,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:37,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:37,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:37,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-10 04:04:37,388 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:04:37,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-11-10 04:04:37,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-10 04:04:37,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:37,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:37,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 22 treesize of output 18 [2018-11-10 04:04:37,417 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:04:37,418 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-10 04:04:37,418 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 04:04:37,425 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 04:04:37,441 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-10 04:04:37,441 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:13 [2018-11-10 04:04:37,446 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 23 treesize of output 18 [2018-11-10 04:04:37,449 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:04:37,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:04:37,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:37,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:37,465 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-10 04:04:37,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:04:37,468 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 13 [2018-11-10 04:04:37,469 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-10 04:04:37,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:37,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:37,472 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-10 04:04:37,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:04:37,528 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 04:04:37,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:04:37,615 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 52 treesize of output 44 [2018-11-10 04:04:37,659 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-10 04:04:37,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:37,676 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 10 treesize of output 8 [2018-11-10 04:04:37,678 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-10 04:04:37,679 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:37,681 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:37,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:37,701 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-10 04:04:37,701 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:10 [2018-11-10 04:04:38,017 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 04:04:38,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 04:04:38,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9] total 24 [2018-11-10 04:04:38,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-10 04:04:38,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-10 04:04:38,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2018-11-10 04:04:38,038 INFO L87 Difference]: Start difference. First operand 1233 states and 1917 transitions. Second operand 24 states. [2018-11-10 04:04:48,404 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2018-11-10 04:04:50,119 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2018-11-10 04:04:51,888 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2018-11-10 04:04:54,626 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-11-10 04:04:55,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:04:55,508 INFO L93 Difference]: Finished difference Result 2787 states and 4284 transitions. [2018-11-10 04:04:55,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 04:04:55,509 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 178 [2018-11-10 04:04:55,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:04:55,510 INFO L225 Difference]: With dead ends: 2787 [2018-11-10 04:04:55,510 INFO L226 Difference]: Without dead ends: 1605 [2018-11-10 04:04:55,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 715 GetRequests, 685 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-11-10 04:04:55,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2018-11-10 04:04:55,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1165. [2018-11-10 04:04:55,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2018-11-10 04:04:55,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1799 transitions. [2018-11-10 04:04:55,582 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1799 transitions. Word has length 178 [2018-11-10 04:04:55,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:04:55,582 INFO L481 AbstractCegarLoop]: Abstraction has 1165 states and 1799 transitions. [2018-11-10 04:04:55,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-10 04:04:55,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1799 transitions. [2018-11-10 04:04:55,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-10 04:04:55,583 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:04:55,583 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:04:55,584 INFO L424 AbstractCegarLoop]: === Iteration 94 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:04:55,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:04:55,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1988960283, now seen corresponding path program 1 times [2018-11-10 04:04:55,584 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:04:55,584 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 96 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 96 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:04:55,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:04:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:04:56,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:04:56,540 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-10 04:04:56,542 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-10 04:04:56,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:56,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:56,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:56,550 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:04:56,561 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 15 [2018-11-10 04:04:56,567 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 3 [2018-11-10 04:04:56,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:04:56,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:04:56,569 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-10 04:04:56,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:04:56,608 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 04:04:56,608 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:04:56,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:04:56,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:04:56,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:04:56,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:04:56,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:04:56,614 INFO L87 Difference]: Start difference. First operand 1165 states and 1799 transitions. Second operand 4 states. [2018-11-10 04:04:59,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:04:59,124 INFO L93 Difference]: Finished difference Result 2320 states and 3589 transitions. [2018-11-10 04:04:59,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:04:59,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2018-11-10 04:04:59,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:04:59,126 INFO L225 Difference]: With dead ends: 2320 [2018-11-10 04:04:59,126 INFO L226 Difference]: Without dead ends: 1206 [2018-11-10 04:04:59,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 179 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-10 04:04:59,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2018-11-10 04:04:59,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1165. [2018-11-10 04:04:59,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2018-11-10 04:04:59,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1797 transitions. [2018-11-10 04:04:59,197 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1797 transitions. Word has length 182 [2018-11-10 04:04:59,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:04:59,197 INFO L481 AbstractCegarLoop]: Abstraction has 1165 states and 1797 transitions. [2018-11-10 04:04:59,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:04:59,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1797 transitions. [2018-11-10 04:04:59,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-10 04:04:59,198 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:04:59,198 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:04:59,198 INFO L424 AbstractCegarLoop]: === Iteration 95 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:04:59,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:04:59,199 INFO L82 PathProgramCache]: Analyzing trace with hash -276746631, now seen corresponding path program 1 times [2018-11-10 04:04:59,199 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:04:59,199 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 97 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 97 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:04:59,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:04:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:05:00,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:05:00,167 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-10 04:05:00,169 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-10 04:05:00,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:00,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:00,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:00,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:05:00,187 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 15 [2018-11-10 04:05:00,190 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 3 [2018-11-10 04:05:00,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:00,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:00,199 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-10 04:05:00,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:05:00,215 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 04:05:00,215 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:05:00,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:05:00,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:05:00,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:05:00,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:05:00,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:05:00,219 INFO L87 Difference]: Start difference. First operand 1165 states and 1797 transitions. Second operand 4 states. [2018-11-10 04:05:02,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:05:02,719 INFO L93 Difference]: Finished difference Result 2320 states and 3585 transitions. [2018-11-10 04:05:02,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:05:02,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2018-11-10 04:05:02,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:05:02,721 INFO L225 Difference]: With dead ends: 2320 [2018-11-10 04:05:02,721 INFO L226 Difference]: Without dead ends: 1206 [2018-11-10 04:05:02,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 179 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-10 04:05:02,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2018-11-10 04:05:02,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1165. [2018-11-10 04:05:02,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2018-11-10 04:05:02,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1795 transitions. [2018-11-10 04:05:02,792 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1795 transitions. Word has length 182 [2018-11-10 04:05:02,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:05:02,792 INFO L481 AbstractCegarLoop]: Abstraction has 1165 states and 1795 transitions. [2018-11-10 04:05:02,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:05:02,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1795 transitions. [2018-11-10 04:05:02,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-10 04:05:02,793 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:05:02,793 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:05:02,793 INFO L424 AbstractCegarLoop]: === Iteration 96 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:05:02,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:05:02,794 INFO L82 PathProgramCache]: Analyzing trace with hash 651147599, now seen corresponding path program 1 times [2018-11-10 04:05:02,794 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:05:02,794 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 98 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 98 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:05:02,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:05:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:05:03,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:05:03,787 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-10 04:05:03,789 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-10 04:05:03,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:03,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:03,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:03,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:05:03,800 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 15 [2018-11-10 04:05:03,801 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 3 [2018-11-10 04:05:03,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:03,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:03,806 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-10 04:05:03,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:05:03,819 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 04:05:03,819 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:05:03,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:05:03,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:05:03,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:05:03,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:05:03,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:05:03,824 INFO L87 Difference]: Start difference. First operand 1165 states and 1795 transitions. Second operand 4 states. [2018-11-10 04:05:06,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:05:06,318 INFO L93 Difference]: Finished difference Result 2320 states and 3581 transitions. [2018-11-10 04:05:06,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:05:06,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-11-10 04:05:06,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:05:06,320 INFO L225 Difference]: With dead ends: 2320 [2018-11-10 04:05:06,320 INFO L226 Difference]: Without dead ends: 1206 [2018-11-10 04:05:06,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 180 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-10 04:05:06,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2018-11-10 04:05:06,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1165. [2018-11-10 04:05:06,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2018-11-10 04:05:06,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1793 transitions. [2018-11-10 04:05:06,394 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1793 transitions. Word has length 183 [2018-11-10 04:05:06,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:05:06,394 INFO L481 AbstractCegarLoop]: Abstraction has 1165 states and 1793 transitions. [2018-11-10 04:05:06,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:05:06,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1793 transitions. [2018-11-10 04:05:06,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-10 04:05:06,396 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:05:06,396 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:05:06,396 INFO L424 AbstractCegarLoop]: === Iteration 97 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:05:06,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:05:06,396 INFO L82 PathProgramCache]: Analyzing trace with hash 493617646, now seen corresponding path program 1 times [2018-11-10 04:05:06,397 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:05:06,397 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 99 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 99 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:05:06,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:05:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:05:07,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:05:07,341 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-10 04:05:07,342 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-10 04:05:07,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:07,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:07,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:07,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:05:07,356 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 15 [2018-11-10 04:05:07,358 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 3 [2018-11-10 04:05:07,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:07,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:07,363 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-10 04:05:07,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:05:07,380 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 04:05:07,380 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:05:07,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:05:07,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:05:07,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:05:07,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:05:07,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:05:07,385 INFO L87 Difference]: Start difference. First operand 1165 states and 1793 transitions. Second operand 4 states. [2018-11-10 04:05:10,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:05:10,066 INFO L93 Difference]: Finished difference Result 2387 states and 3665 transitions. [2018-11-10 04:05:10,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:05:10,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-11-10 04:05:10,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:05:10,068 INFO L225 Difference]: With dead ends: 2387 [2018-11-10 04:05:10,069 INFO L226 Difference]: Without dead ends: 1273 [2018-11-10 04:05:10,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 180 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-10 04:05:10,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2018-11-10 04:05:10,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1165. [2018-11-10 04:05:10,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2018-11-10 04:05:10,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1791 transitions. [2018-11-10 04:05:10,145 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1791 transitions. Word has length 183 [2018-11-10 04:05:10,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:05:10,146 INFO L481 AbstractCegarLoop]: Abstraction has 1165 states and 1791 transitions. [2018-11-10 04:05:10,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:05:10,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1791 transitions. [2018-11-10 04:05:10,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-10 04:05:10,147 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:05:10,147 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:05:10,147 INFO L424 AbstractCegarLoop]: === Iteration 98 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:05:10,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:05:10,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1205390082, now seen corresponding path program 1 times [2018-11-10 04:05:10,148 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:05:10,148 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 100 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 100 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:05:10,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:05:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:05:11,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:05:11,117 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-10 04:05:11,119 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-10 04:05:11,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:11,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:11,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:11,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:05:11,134 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 15 [2018-11-10 04:05:11,136 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 3 [2018-11-10 04:05:11,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:11,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:11,140 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-10 04:05:11,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:05:11,160 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 04:05:11,160 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:05:11,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:05:11,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:05:11,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:05:11,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:05:11,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:05:11,165 INFO L87 Difference]: Start difference. First operand 1165 states and 1791 transitions. Second operand 4 states. [2018-11-10 04:05:13,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:05:13,719 INFO L93 Difference]: Finished difference Result 2320 states and 3573 transitions. [2018-11-10 04:05:13,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:05:13,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-11-10 04:05:13,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:05:13,721 INFO L225 Difference]: With dead ends: 2320 [2018-11-10 04:05:13,721 INFO L226 Difference]: Without dead ends: 1206 [2018-11-10 04:05:13,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 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-10 04:05:13,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2018-11-10 04:05:13,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1165. [2018-11-10 04:05:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2018-11-10 04:05:13,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1789 transitions. [2018-11-10 04:05:13,796 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1789 transitions. Word has length 184 [2018-11-10 04:05:13,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:05:13,796 INFO L481 AbstractCegarLoop]: Abstraction has 1165 states and 1789 transitions. [2018-11-10 04:05:13,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:05:13,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1789 transitions. [2018-11-10 04:05:13,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-10 04:05:13,798 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:05:13,798 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 04:05:13,798 INFO L424 AbstractCegarLoop]: === Iteration 99 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:05:13,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:05:13,799 INFO L82 PathProgramCache]: Analyzing trace with hash 466277933, now seen corresponding path program 1 times [2018-11-10 04:05:13,799 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:05:13,799 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 101 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 101 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:05:13,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:05:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:05:14,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:05:14,773 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-10 04:05:14,774 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-10 04:05:14,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:14,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:14,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:14,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:05:14,785 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 15 [2018-11-10 04:05:14,787 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 3 [2018-11-10 04:05:14,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:14,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:14,789 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-10 04:05:14,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:05:14,802 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 04:05:14,802 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:05:14,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:05:14,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:05:14,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:05:14,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:05:14,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:05:14,807 INFO L87 Difference]: Start difference. First operand 1165 states and 1789 transitions. Second operand 4 states. [2018-11-10 04:05:17,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:05:17,481 INFO L93 Difference]: Finished difference Result 2367 states and 3633 transitions. [2018-11-10 04:05:17,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:05:17,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-11-10 04:05:17,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:05:17,482 INFO L225 Difference]: With dead ends: 2367 [2018-11-10 04:05:17,482 INFO L226 Difference]: Without dead ends: 1253 [2018-11-10 04:05:17,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 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-10 04:05:17,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2018-11-10 04:05:17,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1165. [2018-11-10 04:05:17,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2018-11-10 04:05:17,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1787 transitions. [2018-11-10 04:05:17,553 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1787 transitions. Word has length 184 [2018-11-10 04:05:17,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:05:17,553 INFO L481 AbstractCegarLoop]: Abstraction has 1165 states and 1787 transitions. [2018-11-10 04:05:17,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:05:17,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1787 transitions. [2018-11-10 04:05:17,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-10 04:05:17,555 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:05:17,555 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:05:17,555 INFO L424 AbstractCegarLoop]: === Iteration 100 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:05:17,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:05:17,555 INFO L82 PathProgramCache]: Analyzing trace with hash -2116475711, now seen corresponding path program 1 times [2018-11-10 04:05:17,556 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:05:17,556 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 102 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 102 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:05:17,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:05:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:05:18,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:05:18,539 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-10 04:05:18,541 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-10 04:05:18,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:18,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:18,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:18,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:05:18,553 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 15 [2018-11-10 04:05:18,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 15 treesize of output 3 [2018-11-10 04:05:18,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:18,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:18,558 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-10 04:05:18,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:05:18,571 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 04:05:18,571 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:05:18,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:05:18,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:05:18,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:05:18,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:05:18,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:05:18,577 INFO L87 Difference]: Start difference. First operand 1165 states and 1787 transitions. Second operand 4 states. [2018-11-10 04:05:21,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:05:21,244 INFO L93 Difference]: Finished difference Result 2367 states and 3629 transitions. [2018-11-10 04:05:21,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:05:21,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-11-10 04:05:21,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:05:21,246 INFO L225 Difference]: With dead ends: 2367 [2018-11-10 04:05:21,246 INFO L226 Difference]: Without dead ends: 1253 [2018-11-10 04:05:21,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 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-10 04:05:21,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2018-11-10 04:05:21,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1165. [2018-11-10 04:05:21,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2018-11-10 04:05:21,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1785 transitions. [2018-11-10 04:05:21,333 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1785 transitions. Word has length 184 [2018-11-10 04:05:21,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:05:21,333 INFO L481 AbstractCegarLoop]: Abstraction has 1165 states and 1785 transitions. [2018-11-10 04:05:21,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:05:21,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1785 transitions. [2018-11-10 04:05:21,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-10 04:05:21,334 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:05:21,334 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:05:21,334 INFO L424 AbstractCegarLoop]: === Iteration 101 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:05:21,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:05:21,335 INFO L82 PathProgramCache]: Analyzing trace with hash 728932424, now seen corresponding path program 1 times [2018-11-10 04:05:21,335 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:05:21,335 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 103 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 103 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:05:21,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:05:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:05:22,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:05:22,299 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-10 04:05:22,301 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-10 04:05:22,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:22,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:22,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:22,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:05:22,313 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 15 [2018-11-10 04:05:22,315 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 3 [2018-11-10 04:05:22,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:22,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:22,317 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-10 04:05:22,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:05:22,334 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 04:05:22,334 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:05:22,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:05:22,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:05:22,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:05:22,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:05:22,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:05:22,339 INFO L87 Difference]: Start difference. First operand 1165 states and 1785 transitions. Second operand 4 states. [2018-11-10 04:05:24,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:05:24,992 INFO L93 Difference]: Finished difference Result 2363 states and 3621 transitions. [2018-11-10 04:05:24,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:05:24,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-11-10 04:05:24,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:05:24,994 INFO L225 Difference]: With dead ends: 2363 [2018-11-10 04:05:24,994 INFO L226 Difference]: Without dead ends: 1249 [2018-11-10 04:05:24,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 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-10 04:05:24,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2018-11-10 04:05:25,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1165. [2018-11-10 04:05:25,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2018-11-10 04:05:25,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1783 transitions. [2018-11-10 04:05:25,075 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1783 transitions. Word has length 184 [2018-11-10 04:05:25,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:05:25,075 INFO L481 AbstractCegarLoop]: Abstraction has 1165 states and 1783 transitions. [2018-11-10 04:05:25,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:05:25,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1783 transitions. [2018-11-10 04:05:25,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-10 04:05:25,076 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:05:25,077 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:05:25,077 INFO L424 AbstractCegarLoop]: === Iteration 102 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:05:25,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:05:25,077 INFO L82 PathProgramCache]: Analyzing trace with hash 814996212, now seen corresponding path program 1 times [2018-11-10 04:05:25,078 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:05:25,078 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 104 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 104 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:05:25,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:05:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:05:26,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:05:26,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 13 treesize of output 10 [2018-11-10 04:05:26,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 10 treesize of output 9 [2018-11-10 04:05:26,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:26,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:26,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:26,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:05:26,073 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 15 [2018-11-10 04:05:26,074 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 3 [2018-11-10 04:05:26,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:26,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:26,079 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-10 04:05:26,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:05:26,092 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 04:05:26,092 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:05:26,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:05:26,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:05:26,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:05:26,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:05:26,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:05:26,097 INFO L87 Difference]: Start difference. First operand 1165 states and 1783 transitions. Second operand 4 states. [2018-11-10 04:05:28,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:05:28,564 INFO L93 Difference]: Finished difference Result 2300 states and 3531 transitions. [2018-11-10 04:05:28,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:05:28,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2018-11-10 04:05:28,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:05:28,566 INFO L225 Difference]: With dead ends: 2300 [2018-11-10 04:05:28,566 INFO L226 Difference]: Without dead ends: 1186 [2018-11-10 04:05:28,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 182 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-10 04:05:28,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2018-11-10 04:05:28,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1133. [2018-11-10 04:05:28,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2018-11-10 04:05:28,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1739 transitions. [2018-11-10 04:05:28,656 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1739 transitions. Word has length 185 [2018-11-10 04:05:28,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:05:28,657 INFO L481 AbstractCegarLoop]: Abstraction has 1133 states and 1739 transitions. [2018-11-10 04:05:28,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:05:28,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1739 transitions. [2018-11-10 04:05:28,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-10 04:05:28,658 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:05:28,658 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:05:28,658 INFO L424 AbstractCegarLoop]: === Iteration 103 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:05:28,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:05:28,659 INFO L82 PathProgramCache]: Analyzing trace with hash -545879033, now seen corresponding path program 1 times [2018-11-10 04:05:28,659 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:05:28,660 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 105 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 105 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:05:28,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:05:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:05:29,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:05:29,640 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-10 04:05:29,642 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-10 04:05:29,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:29,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:29,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:29,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:05:29,654 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 15 [2018-11-10 04:05:29,656 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 3 [2018-11-10 04:05:29,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:29,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:29,658 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-10 04:05:29,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:05:29,679 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 04:05:29,679 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:05:29,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:05:29,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:05:29,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:05:29,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:05:29,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:05:29,684 INFO L87 Difference]: Start difference. First operand 1133 states and 1739 transitions. Second operand 4 states. [2018-11-10 04:05:32,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:05:32,334 INFO L93 Difference]: Finished difference Result 2299 states and 3529 transitions. [2018-11-10 04:05:32,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:05:32,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2018-11-10 04:05:32,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:05:32,335 INFO L225 Difference]: With dead ends: 2299 [2018-11-10 04:05:32,335 INFO L226 Difference]: Without dead ends: 1217 [2018-11-10 04:05:32,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 182 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-10 04:05:32,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2018-11-10 04:05:32,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1133. [2018-11-10 04:05:32,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2018-11-10 04:05:32,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1737 transitions. [2018-11-10 04:05:32,407 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1737 transitions. Word has length 185 [2018-11-10 04:05:32,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:05:32,408 INFO L481 AbstractCegarLoop]: Abstraction has 1133 states and 1737 transitions. [2018-11-10 04:05:32,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:05:32,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1737 transitions. [2018-11-10 04:05:32,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-10 04:05:32,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:05:32,409 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:05:32,409 INFO L424 AbstractCegarLoop]: === Iteration 104 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:05:32,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:05:32,409 INFO L82 PathProgramCache]: Analyzing trace with hash 341489990, now seen corresponding path program 1 times [2018-11-10 04:05:32,409 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:05:32,409 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 106 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 106 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:05:32,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:05:33,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:05:33,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:05:33,382 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-10 04:05:33,386 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-10 04:05:33,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:33,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:33,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:33,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:05:33,399 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 15 [2018-11-10 04:05:33,401 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 3 [2018-11-10 04:05:33,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:33,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:33,403 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-10 04:05:33,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:05:33,417 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 04:05:33,417 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:05:33,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:05:33,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:05:33,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:05:33,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:05:33,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:05:33,422 INFO L87 Difference]: Start difference. First operand 1133 states and 1737 transitions. Second operand 4 states. [2018-11-10 04:05:36,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:05:36,070 INFO L93 Difference]: Finished difference Result 2299 states and 3525 transitions. [2018-11-10 04:05:36,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:05:36,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2018-11-10 04:05:36,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:05:36,071 INFO L225 Difference]: With dead ends: 2299 [2018-11-10 04:05:36,071 INFO L226 Difference]: Without dead ends: 1217 [2018-11-10 04:05:36,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 183 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-10 04:05:36,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2018-11-10 04:05:36,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1133. [2018-11-10 04:05:36,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2018-11-10 04:05:36,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1735 transitions. [2018-11-10 04:05:36,144 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1735 transitions. Word has length 186 [2018-11-10 04:05:36,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:05:36,144 INFO L481 AbstractCegarLoop]: Abstraction has 1133 states and 1735 transitions. [2018-11-10 04:05:36,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:05:36,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1735 transitions. [2018-11-10 04:05:36,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-10 04:05:36,145 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:05:36,145 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:05:36,145 INFO L424 AbstractCegarLoop]: === Iteration 105 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:05:36,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:05:36,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1523638188, now seen corresponding path program 1 times [2018-11-10 04:05:36,146 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:05:36,146 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 107 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 107 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:05:36,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:05:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:05:37,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:05:37,119 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-10 04:05:37,120 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-10 04:05:37,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:37,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:37,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:37,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:05:37,133 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 15 [2018-11-10 04:05:37,135 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 3 [2018-11-10 04:05:37,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:37,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:37,138 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-10 04:05:37,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:05:37,152 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 04:05:37,152 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:05:37,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:05:37,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:05:37,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:05:37,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:05:37,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:05:37,159 INFO L87 Difference]: Start difference. First operand 1133 states and 1735 transitions. Second operand 4 states. [2018-11-10 04:05:39,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:05:39,787 INFO L93 Difference]: Finished difference Result 2279 states and 3495 transitions. [2018-11-10 04:05:39,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:05:39,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2018-11-10 04:05:39,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:05:39,789 INFO L225 Difference]: With dead ends: 2279 [2018-11-10 04:05:39,789 INFO L226 Difference]: Without dead ends: 1197 [2018-11-10 04:05:39,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 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-10 04:05:39,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2018-11-10 04:05:39,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1133. [2018-11-10 04:05:39,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2018-11-10 04:05:39,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1733 transitions. [2018-11-10 04:05:39,866 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1733 transitions. Word has length 187 [2018-11-10 04:05:39,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:05:39,866 INFO L481 AbstractCegarLoop]: Abstraction has 1133 states and 1733 transitions. [2018-11-10 04:05:39,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:05:39,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1733 transitions. [2018-11-10 04:05:39,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-10 04:05:39,867 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:05:39,867 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:05:39,867 INFO L424 AbstractCegarLoop]: === Iteration 106 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:05:39,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:05:39,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1642850165, now seen corresponding path program 1 times [2018-11-10 04:05:39,868 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:05:39,868 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 108 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 108 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:05:39,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:05:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:05:40,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:05:40,852 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-10 04:05:40,853 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-10 04:05:40,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:40,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:40,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:40,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:05:40,872 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 15 [2018-11-10 04:05:40,874 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 3 [2018-11-10 04:05:40,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:40,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:40,878 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-10 04:05:40,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:05:40,896 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 04:05:40,896 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:05:40,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:05:40,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:05:40,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:05:40,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:05:40,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:05:40,902 INFO L87 Difference]: Start difference. First operand 1133 states and 1733 transitions. Second operand 4 states. [2018-11-10 04:05:43,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:05:43,520 INFO L93 Difference]: Finished difference Result 2279 states and 3491 transitions. [2018-11-10 04:05:43,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:05:43,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2018-11-10 04:05:43,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:05:43,522 INFO L225 Difference]: With dead ends: 2279 [2018-11-10 04:05:43,522 INFO L226 Difference]: Without dead ends: 1197 [2018-11-10 04:05:43,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 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-10 04:05:43,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2018-11-10 04:05:43,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1133. [2018-11-10 04:05:43,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2018-11-10 04:05:43,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1731 transitions. [2018-11-10 04:05:43,606 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1731 transitions. Word has length 187 [2018-11-10 04:05:43,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:05:43,606 INFO L481 AbstractCegarLoop]: Abstraction has 1133 states and 1731 transitions. [2018-11-10 04:05:43,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:05:43,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1731 transitions. [2018-11-10 04:05:43,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-10 04:05:43,607 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:05:43,607 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:05:43,607 INFO L424 AbstractCegarLoop]: === Iteration 107 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:05:43,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:05:43,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1575772539, now seen corresponding path program 1 times [2018-11-10 04:05:43,608 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:05:43,608 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 109 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 109 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:05:43,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:05:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:05:44,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:05:44,674 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-10 04:05:44,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 04:05:44,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:44,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:44,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:44,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:05:44,692 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 15 [2018-11-10 04:05:44,694 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 3 [2018-11-10 04:05:44,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:44,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:44,696 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-10 04:05:44,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:05:44,712 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 04:05:44,712 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:05:44,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:05:44,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:05:44,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:05:44,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:05:44,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:05:44,717 INFO L87 Difference]: Start difference. First operand 1133 states and 1731 transitions. Second operand 4 states. [2018-11-10 04:05:47,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:05:47,288 INFO L93 Difference]: Finished difference Result 2263 states and 3461 transitions. [2018-11-10 04:05:47,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:05:47,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-11-10 04:05:47,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:05:47,289 INFO L225 Difference]: With dead ends: 2263 [2018-11-10 04:05:47,289 INFO L226 Difference]: Without dead ends: 1181 [2018-11-10 04:05:47,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 185 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-10 04:05:47,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2018-11-10 04:05:47,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1133. [2018-11-10 04:05:47,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2018-11-10 04:05:47,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1729 transitions. [2018-11-10 04:05:47,363 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1729 transitions. Word has length 188 [2018-11-10 04:05:47,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:05:47,363 INFO L481 AbstractCegarLoop]: Abstraction has 1133 states and 1729 transitions. [2018-11-10 04:05:47,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:05:47,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1729 transitions. [2018-11-10 04:05:47,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-10 04:05:47,364 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:05:47,364 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-10 04:05:47,365 INFO L424 AbstractCegarLoop]: === Iteration 108 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:05:47,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:05:47,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1410391419, now seen corresponding path program 1 times [2018-11-10 04:05:47,365 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:05:47,365 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 110 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 110 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:05:47,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:05:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:05:49,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:05:49,476 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 18 treesize of output 15 [2018-11-10 04:05:49,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 04:05:49,481 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:05:49,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:05:49,483 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:49,488 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:49,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:49,501 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-10 04:05:49,501 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:05:49,514 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 13 [2018-11-10 04:05:49,515 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-10 04:05:49,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:49,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:49,518 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-10 04:05:49,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:05:49,542 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 230 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 04:05:49,542 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:05:49,563 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 04:05:49,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:49,563 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-10 04:05:49,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 04:05:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 04:05:49,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:05:49,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 04:05:49,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 04:05:49,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 04:05:49,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 04:05:49,585 INFO L87 Difference]: Start difference. First operand 1133 states and 1729 transitions. Second operand 9 states. [2018-11-10 04:05:53,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:05:53,206 INFO L93 Difference]: Finished difference Result 2619 states and 3964 transitions. [2018-11-10 04:05:53,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 04:05:53,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 191 [2018-11-10 04:05:53,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:05:53,208 INFO L225 Difference]: With dead ends: 2619 [2018-11-10 04:05:53,208 INFO L226 Difference]: Without dead ends: 1537 [2018-11-10 04:05:53,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 04:05:53,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2018-11-10 04:05:53,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1133. [2018-11-10 04:05:53,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2018-11-10 04:05:53,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1721 transitions. [2018-11-10 04:05:53,285 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1721 transitions. Word has length 191 [2018-11-10 04:05:53,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:05:53,285 INFO L481 AbstractCegarLoop]: Abstraction has 1133 states and 1721 transitions. [2018-11-10 04:05:53,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 04:05:53,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1721 transitions. [2018-11-10 04:05:53,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-10 04:05:53,286 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:05:53,286 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:05:53,286 INFO L424 AbstractCegarLoop]: === Iteration 109 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:05:53,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:05:53,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1178506176, now seen corresponding path program 1 times [2018-11-10 04:05:53,287 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:05:53,287 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 111 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 111 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:05:53,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:05:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:05:55,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:05:55,718 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 18 treesize of output 15 [2018-11-10 04:05:55,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 04:05:55,723 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:05:55,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:05:55,725 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:55,732 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:55,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:55,746 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-10 04:05:55,746 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:05:55,758 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 15 [2018-11-10 04:05:55,760 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 3 [2018-11-10 04:05:55,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:55,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:55,765 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-10 04:05:55,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 04:05:55,786 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 04:05:55,786 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:05:55,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:05:55,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:05:55,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:05:55,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:05:55,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:05:55,794 INFO L87 Difference]: Start difference. First operand 1133 states and 1721 transitions. Second operand 7 states. [2018-11-10 04:05:56,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:05:56,937 INFO L93 Difference]: Finished difference Result 2411 states and 3669 transitions. [2018-11-10 04:05:56,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:05:56,937 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 192 [2018-11-10 04:05:56,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:05:56,939 INFO L225 Difference]: With dead ends: 2411 [2018-11-10 04:05:56,939 INFO L226 Difference]: Without dead ends: 1329 [2018-11-10 04:05:56,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:05:56,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2018-11-10 04:05:57,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1157. [2018-11-10 04:05:57,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2018-11-10 04:05:57,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1755 transitions. [2018-11-10 04:05:57,022 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1755 transitions. Word has length 192 [2018-11-10 04:05:57,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:05:57,022 INFO L481 AbstractCegarLoop]: Abstraction has 1157 states and 1755 transitions. [2018-11-10 04:05:57,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:05:57,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1755 transitions. [2018-11-10 04:05:57,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-10 04:05:57,023 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:05:57,023 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:05:57,024 INFO L424 AbstractCegarLoop]: === Iteration 110 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:05:57,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:05:57,024 INFO L82 PathProgramCache]: Analyzing trace with hash 533707476, now seen corresponding path program 1 times [2018-11-10 04:05:57,025 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:05:57,025 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 112 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 112 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:05:57,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:05:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:05:59,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:05:59,201 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-10 04:05:59,203 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-10 04:05:59,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:59,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:59,211 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-10 04:05:59,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-10 04:05:59,241 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 23 treesize of output 18 [2018-11-10 04:05:59,243 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:05:59,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:05:59,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:59,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:59,259 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-10 04:05:59,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:05:59,264 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 23 treesize of output 18 [2018-11-10 04:05:59,267 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:05:59,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:05:59,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:59,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:59,281 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-10 04:05:59,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:05:59,284 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-10 04:05:59,288 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-10 04:05:59,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:05:59,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:05:59,290 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-10 04:05:59,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:3 [2018-11-10 04:05:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-10 04:05:59,310 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:05:59,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:05:59,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 04:05:59,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 04:05:59,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 04:05:59,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 04:05:59,318 INFO L87 Difference]: Start difference. First operand 1157 states and 1755 transitions. Second operand 8 states. [2018-11-10 04:06:00,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:06:00,238 INFO L93 Difference]: Finished difference Result 2283 states and 3473 transitions. [2018-11-10 04:06:00,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 04:06:00,239 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 192 [2018-11-10 04:06:00,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:06:00,239 INFO L225 Difference]: With dead ends: 2283 [2018-11-10 04:06:00,239 INFO L226 Difference]: Without dead ends: 1177 [2018-11-10 04:06:00,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-10 04:06:00,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2018-11-10 04:06:00,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1175. [2018-11-10 04:06:00,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1175 states. [2018-11-10 04:06:00,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1777 transitions. [2018-11-10 04:06:00,319 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1777 transitions. Word has length 192 [2018-11-10 04:06:00,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:06:00,319 INFO L481 AbstractCegarLoop]: Abstraction has 1175 states and 1777 transitions. [2018-11-10 04:06:00,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 04:06:00,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1777 transitions. [2018-11-10 04:06:00,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-10 04:06:00,320 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:06:00,320 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-10 04:06:00,320 INFO L424 AbstractCegarLoop]: === Iteration 111 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:06:00,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:06:00,320 INFO L82 PathProgramCache]: Analyzing trace with hash -915851685, now seen corresponding path program 1 times [2018-11-10 04:06:00,321 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:06:00,321 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 113 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 113 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:06:00,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:06:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:06:02,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:06:02,448 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 18 treesize of output 15 [2018-11-10 04:06:02,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 04:06:02,454 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:06:02,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:06:02,456 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:02,463 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:02,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:02,477 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-10 04:06:02,477 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:06:02,490 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 13 [2018-11-10 04:06:02,492 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-10 04:06:02,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:02,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:02,495 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-10 04:06:02,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:06:02,519 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 233 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 04:06:02,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:06:02,538 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 04:06:02,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:02,539 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-10 04:06:02,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 04:06:02,554 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 04:06:02,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:06:02,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 04:06:02,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 04:06:02,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 04:06:02,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 04:06:02,561 INFO L87 Difference]: Start difference. First operand 1175 states and 1777 transitions. Second operand 9 states. [2018-11-10 04:06:06,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:06:06,236 INFO L93 Difference]: Finished difference Result 2691 states and 4038 transitions. [2018-11-10 04:06:06,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 04:06:06,236 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 192 [2018-11-10 04:06:06,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:06:06,238 INFO L225 Difference]: With dead ends: 2691 [2018-11-10 04:06:06,238 INFO L226 Difference]: Without dead ends: 1567 [2018-11-10 04:06:06,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 04:06:06,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2018-11-10 04:06:06,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1175. [2018-11-10 04:06:06,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1175 states. [2018-11-10 04:06:06,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1769 transitions. [2018-11-10 04:06:06,326 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1769 transitions. Word has length 192 [2018-11-10 04:06:06,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:06:06,326 INFO L481 AbstractCegarLoop]: Abstraction has 1175 states and 1769 transitions. [2018-11-10 04:06:06,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 04:06:06,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1769 transitions. [2018-11-10 04:06:06,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-10 04:06:06,328 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:06:06,328 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:06:06,328 INFO L424 AbstractCegarLoop]: === Iteration 112 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:06:06,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:06:06,328 INFO L82 PathProgramCache]: Analyzing trace with hash 5421140, now seen corresponding path program 1 times [2018-11-10 04:06:06,329 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:06:06,329 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 114 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 114 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:06:06,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:06:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:06:08,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:06:08,640 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-10 04:06:08,642 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-10 04:06:08,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:08,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:08,652 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-10 04:06:08,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-10 04:06:08,679 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 23 treesize of output 18 [2018-11-10 04:06:08,682 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:06:08,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:06:08,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:08,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:08,702 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-10 04:06:08,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:06:08,708 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 23 treesize of output 18 [2018-11-10 04:06:08,713 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:06:08,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:06:08,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:08,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:08,732 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-10 04:06:08,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:06:08,735 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-10 04:06:08,741 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-10 04:06:08,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:08,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:08,752 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-10 04:06:08,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:5 [2018-11-10 04:06:08,783 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-11-10 04:06:08,783 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:06:08,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:06:08,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 04:06:08,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 04:06:08,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 04:06:08,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 04:06:08,789 INFO L87 Difference]: Start difference. First operand 1175 states and 1769 transitions. Second operand 8 states. [2018-11-10 04:06:13,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:06:13,829 INFO L93 Difference]: Finished difference Result 2319 states and 3501 transitions. [2018-11-10 04:06:13,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 04:06:13,829 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 193 [2018-11-10 04:06:13,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:06:13,830 INFO L225 Difference]: With dead ends: 2319 [2018-11-10 04:06:13,830 INFO L226 Difference]: Without dead ends: 1195 [2018-11-10 04:06:13,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-10 04:06:13,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2018-11-10 04:06:13,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1175. [2018-11-10 04:06:13,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1175 states. [2018-11-10 04:06:13,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1769 transitions. [2018-11-10 04:06:13,913 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1769 transitions. Word has length 193 [2018-11-10 04:06:13,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:06:13,913 INFO L481 AbstractCegarLoop]: Abstraction has 1175 states and 1769 transitions. [2018-11-10 04:06:13,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 04:06:13,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1769 transitions. [2018-11-10 04:06:13,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-10 04:06:13,914 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:06:13,914 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:06:13,914 INFO L424 AbstractCegarLoop]: === Iteration 113 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:06:13,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:06:13,914 INFO L82 PathProgramCache]: Analyzing trace with hash 251926169, now seen corresponding path program 1 times [2018-11-10 04:06:13,915 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:06:13,915 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 115 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 115 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:06:13,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:06:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:06:16,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:06:16,357 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-10 04:06:16,360 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-10 04:06:16,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:16,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:16,370 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-10 04:06:16,370 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-10 04:06:16,397 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 23 treesize of output 18 [2018-11-10 04:06:16,400 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:06:16,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:06:16,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:16,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:16,416 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-10 04:06:16,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:06:16,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, 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 18 [2018-11-10 04:06:16,427 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:06:16,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:06:16,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:16,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:16,445 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-10 04:06:16,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:06:16,447 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-10 04:06:16,451 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-10 04:06:16,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:16,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:16,454 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-10 04:06:16,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:3 [2018-11-10 04:06:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-10 04:06:16,481 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:06:16,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:06:16,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 04:06:16,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 04:06:16,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 04:06:16,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 04:06:16,489 INFO L87 Difference]: Start difference. First operand 1175 states and 1769 transitions. Second operand 8 states. [2018-11-10 04:06:17,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:06:17,552 INFO L93 Difference]: Finished difference Result 2319 states and 3501 transitions. [2018-11-10 04:06:17,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 04:06:17,553 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 194 [2018-11-10 04:06:17,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:06:17,554 INFO L225 Difference]: With dead ends: 2319 [2018-11-10 04:06:17,554 INFO L226 Difference]: Without dead ends: 1195 [2018-11-10 04:06:17,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-10 04:06:17,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2018-11-10 04:06:17,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1175. [2018-11-10 04:06:17,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1175 states. [2018-11-10 04:06:17,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1769 transitions. [2018-11-10 04:06:17,643 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1769 transitions. Word has length 194 [2018-11-10 04:06:17,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:06:17,643 INFO L481 AbstractCegarLoop]: Abstraction has 1175 states and 1769 transitions. [2018-11-10 04:06:17,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 04:06:17,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1769 transitions. [2018-11-10 04:06:17,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-10 04:06:17,644 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:06:17,644 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:06:17,644 INFO L424 AbstractCegarLoop]: === Iteration 114 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:06:17,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:06:17,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1252840263, now seen corresponding path program 1 times [2018-11-10 04:06:17,645 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:06:17,645 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 116 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 116 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:06:17,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:06:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:06:20,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:06:20,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 04:06:20,117 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-10 04:06:20,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:20,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:20,126 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-10 04:06:20,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-10 04:06:20,154 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 23 treesize of output 18 [2018-11-10 04:06:20,157 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:06:20,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:06:20,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:20,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:20,174 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-10 04:06:20,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:06:20,179 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 23 treesize of output 18 [2018-11-10 04:06:20,183 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:06:20,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:06:20,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:20,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:20,200 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-10 04:06:20,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:06:20,203 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-10 04:06:20,208 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-10 04:06:20,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:20,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:20,210 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-10 04:06:20,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:5 [2018-11-10 04:06:20,239 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-10 04:06:20,239 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:06:20,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:06:20,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 04:06:20,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 04:06:20,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 04:06:20,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 04:06:20,246 INFO L87 Difference]: Start difference. First operand 1175 states and 1769 transitions. Second operand 8 states. [2018-11-10 04:06:23,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:06:23,307 INFO L93 Difference]: Finished difference Result 2301 states and 3477 transitions. [2018-11-10 04:06:23,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 04:06:23,307 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 195 [2018-11-10 04:06:23,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:06:23,308 INFO L225 Difference]: With dead ends: 2301 [2018-11-10 04:06:23,308 INFO L226 Difference]: Without dead ends: 1177 [2018-11-10 04:06:23,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-10 04:06:23,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2018-11-10 04:06:23,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1157. [2018-11-10 04:06:23,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2018-11-10 04:06:23,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1745 transitions. [2018-11-10 04:06:23,388 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1745 transitions. Word has length 195 [2018-11-10 04:06:23,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:06:23,388 INFO L481 AbstractCegarLoop]: Abstraction has 1157 states and 1745 transitions. [2018-11-10 04:06:23,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 04:06:23,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1745 transitions. [2018-11-10 04:06:23,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-10 04:06:23,389 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:06:23,389 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:06:23,390 INFO L424 AbstractCegarLoop]: === Iteration 115 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:06:23,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:06:23,390 INFO L82 PathProgramCache]: Analyzing trace with hash -124361320, now seen corresponding path program 1 times [2018-11-10 04:06:23,390 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:06:23,390 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 117 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 117 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:06:23,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:06:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:06:25,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:06:25,666 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 18 treesize of output 15 [2018-11-10 04:06:25,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 04:06:25,676 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:06:25,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:06:25,684 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:25,694 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:25,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:25,718 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-10 04:06:25,718 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:06:25,734 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 13 [2018-11-10 04:06:25,735 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-10 04:06:25,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:25,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:25,738 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-10 04:06:25,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:06:25,778 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 224 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 04:06:25,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:06:25,806 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 04:06:25,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:25,807 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-10 04:06:25,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-10 04:06:25,824 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 04:06:25,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:06:25,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 04:06:25,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 04:06:25,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 04:06:25,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 04:06:25,831 INFO L87 Difference]: Start difference. First operand 1157 states and 1745 transitions. Second operand 9 states. [2018-11-10 04:06:29,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:06:29,200 INFO L93 Difference]: Finished difference Result 2701 states and 4058 transitions. [2018-11-10 04:06:29,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 04:06:29,200 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 195 [2018-11-10 04:06:29,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:06:29,201 INFO L225 Difference]: With dead ends: 2701 [2018-11-10 04:06:29,202 INFO L226 Difference]: Without dead ends: 1595 [2018-11-10 04:06:29,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 04:06:29,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2018-11-10 04:06:29,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1215. [2018-11-10 04:06:29,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1215 states. [2018-11-10 04:06:29,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1835 transitions. [2018-11-10 04:06:29,290 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1835 transitions. Word has length 195 [2018-11-10 04:06:29,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:06:29,290 INFO L481 AbstractCegarLoop]: Abstraction has 1215 states and 1835 transitions. [2018-11-10 04:06:29,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 04:06:29,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1835 transitions. [2018-11-10 04:06:29,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-10 04:06:29,291 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:06:29,291 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:06:29,292 INFO L424 AbstractCegarLoop]: === Iteration 116 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:06:29,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:06:29,292 INFO L82 PathProgramCache]: Analyzing trace with hash 114462316, now seen corresponding path program 1 times [2018-11-10 04:06:29,292 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:06:29,292 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 118 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 118 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:06:29,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:06:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:06:31,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:06:31,210 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-10 04:06:31,212 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-10 04:06:31,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:31,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:31,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:31,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:06:31,232 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 23 treesize of output 18 [2018-11-10 04:06:31,235 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:06:31,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:06:31,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:31,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:31,250 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-10 04:06:31,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:06:31,253 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 13 [2018-11-10 04:06:31,254 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-10 04:06:31,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:31,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:31,264 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-10 04:06:31,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:06:31,287 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-10 04:06:31,287 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:06:31,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:06:31,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:06:31,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:06:31,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:06:31,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:06:31,293 INFO L87 Difference]: Start difference. First operand 1215 states and 1835 transitions. Second operand 7 states. [2018-11-10 04:06:32,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:06:32,157 INFO L93 Difference]: Finished difference Result 2427 states and 3668 transitions. [2018-11-10 04:06:32,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:06:32,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 195 [2018-11-10 04:06:32,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:06:32,159 INFO L225 Difference]: With dead ends: 2427 [2018-11-10 04:06:32,159 INFO L226 Difference]: Without dead ends: 1263 [2018-11-10 04:06:32,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:06:32,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2018-11-10 04:06:32,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1215. [2018-11-10 04:06:32,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1215 states. [2018-11-10 04:06:32,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1833 transitions. [2018-11-10 04:06:32,248 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1833 transitions. Word has length 195 [2018-11-10 04:06:32,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:06:32,248 INFO L481 AbstractCegarLoop]: Abstraction has 1215 states and 1833 transitions. [2018-11-10 04:06:32,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:06:32,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1833 transitions. [2018-11-10 04:06:32,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-10 04:06:32,249 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:06:32,249 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:06:32,249 INFO L424 AbstractCegarLoop]: === Iteration 117 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:06:32,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:06:32,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1289564213, now seen corresponding path program 1 times [2018-11-10 04:06:32,250 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:06:32,250 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 119 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 119 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:06:32,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:06:33,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:06:34,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:06:34,179 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-10 04:06:34,180 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-10 04:06:34,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:34,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:34,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:34,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:06:34,208 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 23 treesize of output 18 [2018-11-10 04:06:34,211 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:06:34,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:06:34,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:34,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:34,228 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-10 04:06:34,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:06:34,230 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 13 [2018-11-10 04:06:34,232 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-10 04:06:34,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:34,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:34,234 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-10 04:06:34,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:06:34,258 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-10 04:06:34,258 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:06:34,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:06:34,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:06:34,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:06:34,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:06:34,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:06:34,265 INFO L87 Difference]: Start difference. First operand 1215 states and 1833 transitions. Second operand 7 states. [2018-11-10 04:06:37,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:06:37,170 INFO L93 Difference]: Finished difference Result 2415 states and 3648 transitions. [2018-11-10 04:06:37,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:06:37,171 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 196 [2018-11-10 04:06:37,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:06:37,172 INFO L225 Difference]: With dead ends: 2415 [2018-11-10 04:06:37,172 INFO L226 Difference]: Without dead ends: 1251 [2018-11-10 04:06:37,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:06:37,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2018-11-10 04:06:37,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1215. [2018-11-10 04:06:37,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1215 states. [2018-11-10 04:06:37,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1831 transitions. [2018-11-10 04:06:37,261 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1831 transitions. Word has length 196 [2018-11-10 04:06:37,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:06:37,261 INFO L481 AbstractCegarLoop]: Abstraction has 1215 states and 1831 transitions. [2018-11-10 04:06:37,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:06:37,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1831 transitions. [2018-11-10 04:06:37,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-10 04:06:37,262 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:06:37,262 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:06:37,262 INFO L424 AbstractCegarLoop]: === Iteration 118 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:06:37,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:06:37,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1747258600, now seen corresponding path program 1 times [2018-11-10 04:06:37,262 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:06:37,263 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 120 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 120 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:06:37,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:06:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:06:39,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:06:39,528 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 18 treesize of output 15 [2018-11-10 04:06:39,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 04:06:39,533 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:06:39,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:06:39,535 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:39,541 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:39,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:39,559 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-10 04:06:39,559 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:06:39,571 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 13 [2018-11-10 04:06:39,572 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-10 04:06:39,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:39,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:39,574 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-10 04:06:39,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:06:39,598 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 227 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 04:06:39,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:06:39,619 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 04:06:39,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:39,620 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-10 04:06:39,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 04:06:39,635 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 04:06:39,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:06:39,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 04:06:39,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 04:06:39,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 04:06:39,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 04:06:39,641 INFO L87 Difference]: Start difference. First operand 1215 states and 1831 transitions. Second operand 9 states. [2018-11-10 04:06:43,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:06:43,144 INFO L93 Difference]: Finished difference Result 2719 states and 4068 transitions. [2018-11-10 04:06:43,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 04:06:43,144 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 196 [2018-11-10 04:06:43,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:06:43,146 INFO L225 Difference]: With dead ends: 2719 [2018-11-10 04:06:43,146 INFO L226 Difference]: Without dead ends: 1555 [2018-11-10 04:06:43,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 04:06:43,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2018-11-10 04:06:43,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1215. [2018-11-10 04:06:43,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1215 states. [2018-11-10 04:06:43,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1821 transitions. [2018-11-10 04:06:43,239 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1821 transitions. Word has length 196 [2018-11-10 04:06:43,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:06:43,239 INFO L481 AbstractCegarLoop]: Abstraction has 1215 states and 1821 transitions. [2018-11-10 04:06:43,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 04:06:43,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1821 transitions. [2018-11-10 04:06:43,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-10 04:06:43,240 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:06:43,240 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:06:43,241 INFO L424 AbstractCegarLoop]: === Iteration 119 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:06:43,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:06:43,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1978896832, now seen corresponding path program 1 times [2018-11-10 04:06:43,242 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:06:43,242 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 121 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 121 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:06:43,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:06:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:06:45,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:06:45,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 04:06:45,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 04:06:45,866 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:06:45,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:06:45,868 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:45,874 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:45,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:45,887 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-10 04:06:45,887 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:06:45,899 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 15 [2018-11-10 04:06:45,900 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 3 [2018-11-10 04:06:45,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:45,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:45,905 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-10 04:06:45,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 04:06:45,927 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-10 04:06:45,927 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:06:45,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:06:45,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:06:45,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:06:45,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:06:45,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:06:45,933 INFO L87 Difference]: Start difference. First operand 1215 states and 1821 transitions. Second operand 7 states. [2018-11-10 04:06:49,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:06:49,038 INFO L93 Difference]: Finished difference Result 2513 states and 3759 transitions. [2018-11-10 04:06:49,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:06:49,039 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 201 [2018-11-10 04:06:49,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:06:49,040 INFO L225 Difference]: With dead ends: 2513 [2018-11-10 04:06:49,040 INFO L226 Difference]: Without dead ends: 1349 [2018-11-10 04:06:49,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:06:49,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2018-11-10 04:06:49,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1215. [2018-11-10 04:06:49,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1215 states. [2018-11-10 04:06:49,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1819 transitions. [2018-11-10 04:06:49,135 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1819 transitions. Word has length 201 [2018-11-10 04:06:49,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:06:49,135 INFO L481 AbstractCegarLoop]: Abstraction has 1215 states and 1819 transitions. [2018-11-10 04:06:49,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:06:49,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1819 transitions. [2018-11-10 04:06:49,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-10 04:06:49,136 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:06:49,136 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:06:49,136 INFO L424 AbstractCegarLoop]: === Iteration 120 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:06:49,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:06:49,137 INFO L82 PathProgramCache]: Analyzing trace with hash -600736135, now seen corresponding path program 1 times [2018-11-10 04:06:49,137 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:06:49,137 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 122 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 122 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:06:49,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:06:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:06:51,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:06:51,311 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 18 treesize of output 15 [2018-11-10 04:06:51,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 04:06:51,316 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:06:51,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:06:51,319 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:51,328 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:51,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:51,340 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-10 04:06:51,341 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:06:51,353 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 13 [2018-11-10 04:06:51,354 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-10 04:06:51,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:51,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:51,356 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-10 04:06:51,356 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:06:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 250 proven. 1 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-10 04:06:51,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:06:51,409 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 04:06:51,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:51,410 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-10 04:06:51,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 04:06:51,427 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-10 04:06:51,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:06:51,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 04:06:51,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 04:06:51,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 04:06:51,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 04:06:51,433 INFO L87 Difference]: Start difference. First operand 1215 states and 1819 transitions. Second operand 9 states. [2018-11-10 04:06:54,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:06:54,924 INFO L93 Difference]: Finished difference Result 2719 states and 4042 transitions. [2018-11-10 04:06:54,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 04:06:54,924 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 203 [2018-11-10 04:06:54,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:06:54,925 INFO L225 Difference]: With dead ends: 2719 [2018-11-10 04:06:54,925 INFO L226 Difference]: Without dead ends: 1555 [2018-11-10 04:06:54,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 04:06:54,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2018-11-10 04:06:55,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1215. [2018-11-10 04:06:55,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1215 states. [2018-11-10 04:06:55,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1813 transitions. [2018-11-10 04:06:55,012 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1813 transitions. Word has length 203 [2018-11-10 04:06:55,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:06:55,013 INFO L481 AbstractCegarLoop]: Abstraction has 1215 states and 1813 transitions. [2018-11-10 04:06:55,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 04:06:55,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1813 transitions. [2018-11-10 04:06:55,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-10 04:06:55,014 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:06:55,014 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:06:55,014 INFO L424 AbstractCegarLoop]: === Iteration 121 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:06:55,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:06:55,014 INFO L82 PathProgramCache]: Analyzing trace with hash -717622946, now seen corresponding path program 1 times [2018-11-10 04:06:55,014 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:06:55,014 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 123 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 123 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:06:55,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:06:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:06:57,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:06:57,132 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 18 treesize of output 15 [2018-11-10 04:06:57,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 04:06:57,136 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:06:57,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 04:06:57,139 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:57,145 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:57,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:57,158 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-10 04:06:57,158 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:06:57,171 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 13 [2018-11-10 04:06:57,172 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-10 04:06:57,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:57,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:06:57,174 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-10 04:06:57,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:06:57,201 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 253 proven. 1 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-10 04:06:57,201 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:06:57,221 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 04:06:57,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 04:06:57,221 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-10 04:06:57,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 04:06:57,238 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-10 04:06:57,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:06:57,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 04:06:57,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 04:06:57,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 04:06:57,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 04:06:57,244 INFO L87 Difference]: Start difference. First operand 1215 states and 1813 transitions. Second operand 9 states. [2018-11-10 04:07:00,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:07:00,789 INFO L93 Difference]: Finished difference Result 2713 states and 4021 transitions. [2018-11-10 04:07:00,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 04:07:00,789 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 204 [2018-11-10 04:07:00,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:07:00,790 INFO L225 Difference]: With dead ends: 2713 [2018-11-10 04:07:00,790 INFO L226 Difference]: Without dead ends: 1549 [2018-11-10 04:07:00,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 04:07:00,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2018-11-10 04:07:00,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 1215. [2018-11-10 04:07:00,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1215 states. [2018-11-10 04:07:00,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1807 transitions. [2018-11-10 04:07:00,880 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1807 transitions. Word has length 204 [2018-11-10 04:07:00,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:07:00,880 INFO L481 AbstractCegarLoop]: Abstraction has 1215 states and 1807 transitions. [2018-11-10 04:07:00,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 04:07:00,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1807 transitions. [2018-11-10 04:07:00,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-10 04:07:00,881 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:07:00,881 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:07:00,881 INFO L424 AbstractCegarLoop]: === Iteration 122 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:07:00,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:07:00,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1096033176, now seen corresponding path program 1 times [2018-11-10 04:07:00,882 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:07:00,882 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 124 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 124 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:07:00,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:07:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:07:06,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:07:06,251 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 5 treesize of output 1 [2018-11-10 04:07:06,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:06,301 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-10 04:07:06,305 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-10 04:07:06,305 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:06,312 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:06,343 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 23 treesize of output 20 [2018-11-10 04:07:06,345 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 04:07:06,349 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:06,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 04:07:06,356 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:06,357 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:06,359 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:06,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 04:07:06,366 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:06,388 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:06,397 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:06,406 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:06,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:06,426 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:48, output treesize:14 [2018-11-10 04:07:06,463 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 107 treesize of output 78 [2018-11-10 04:07:06,468 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-10 04:07:06,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:06,496 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:06,523 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 77 treesize of output 53 [2018-11-10 04:07:06,526 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 22 treesize of output 21 [2018-11-10 04:07:06,526 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:06,546 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:06,555 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 42 treesize of output 47 [2018-11-10 04:07:06,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 04:07:06,619 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 04:07:06,653 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 04:07:06,684 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 04:07:06,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 04:07:06,772 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-10 04:07:06,772 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:119, output treesize:76 [2018-11-10 04:07:06,877 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 31 treesize of output 28 [2018-11-10 04:07:06,880 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 28 treesize of output 27 [2018-11-10 04:07:06,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:06,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:06,939 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 49 treesize of output 33 [2018-11-10 04:07:06,941 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 33 treesize of output 9 [2018-11-10 04:07:06,942 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:06,944 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:06,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:06,957 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:21 [2018-11-10 04:07:06,976 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 8 treesize of output 6 [2018-11-10 04:07:06,978 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 6 treesize of output 4 [2018-11-10 04:07:06,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:06,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:06,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:06,985 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:13 [2018-11-10 04:07:07,002 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 13 [2018-11-10 04:07:07,003 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-10 04:07:07,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:07,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:07,005 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-10 04:07:07,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:07:07,079 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 100 proven. 120 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 04:07:07,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:07:07,140 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 126 treesize of output 98 [2018-11-10 04:07:07,145 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-10 04:07:07,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:07,166 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:07,177 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 97 treesize of output 72 [2018-11-10 04:07:07,235 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:07:07,289 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 34 treesize of output 54 [2018-11-10 04:07:07,289 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 04:07:07,325 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 39 treesize of output 23 [2018-11-10 04:07:07,328 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:07:07,328 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:07:07,329 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 23 treesize of output 13 [2018-11-10 04:07:07,329 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:07,333 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:07,337 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 37 treesize of output 29 [2018-11-10 04:07:07,340 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 14 treesize of output 1 [2018-11-10 04:07:07,340 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:07,345 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:07,355 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:07,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:07,376 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-10 04:07:07,376 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:126, output treesize:10 [2018-11-10 04:07:07,500 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 04:07:07,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:07:07,506 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:07:07,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:07:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:07:07,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:07:07,873 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 5 treesize of output 1 [2018-11-10 04:07:07,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:07,930 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 23 treesize of output 20 [2018-11-10 04:07:07,933 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 04:07:07,938 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:07,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 04:07:07,950 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:07,953 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:07,955 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:07,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 04:07:07,968 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:07,997 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:08,018 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:08,038 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:08,083 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 23 treesize of output 20 [2018-11-10 04:07:08,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 04:07:08,096 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:08,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 04:07:08,107 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:08,111 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:08,113 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:08,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 04:07:08,126 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:08,142 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:08,152 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:08,163 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:08,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:08,191 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:58, output treesize:23 [2018-11-10 04:07:08,297 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 107 treesize of output 78 [2018-11-10 04:07:08,303 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-10 04:07:08,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:08,340 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:08,361 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 77 treesize of output 53 [2018-11-10 04:07:08,363 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 22 treesize of output 21 [2018-11-10 04:07:08,363 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:08,379 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:08,387 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 42 treesize of output 47 [2018-11-10 04:07:08,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 04:07:08,432 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 04:07:08,451 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 04:07:08,470 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 04:07:08,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 04:07:08,519 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-10 04:07:08,519 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:126, output treesize:90 [2018-11-10 04:07:08,603 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 31 treesize of output 28 [2018-11-10 04:07:08,605 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 28 treesize of output 27 [2018-11-10 04:07:08,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:08,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:08,622 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 56 treesize of output 50 [2018-11-10 04:07:08,624 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:07:08,624 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 50 treesize of output 38 [2018-11-10 04:07:08,624 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:08,631 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:08,642 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 41 treesize of output 35 [2018-11-10 04:07:08,644 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:07:08,645 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-11-10 04:07:08,645 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 04:07:08,652 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 04:07:08,660 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 21 treesize of output 17 [2018-11-10 04:07:08,662 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-10 04:07:08,662 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:08,664 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:08,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:08,672 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:71, output treesize:13 [2018-11-10 04:07:08,675 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 13 [2018-11-10 04:07:08,676 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-10 04:07:08,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:08,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:08,678 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-10 04:07:08,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:07:08,765 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 96 proven. 124 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 04:07:08,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:07:08,786 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 128 treesize of output 100 [2018-11-10 04:07:08,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-10 04:07:08,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:08,814 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:08,823 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 99 treesize of output 74 [2018-11-10 04:07:08,890 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:07:08,945 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 32 treesize of output 54 [2018-11-10 04:07:08,945 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 04:07:08,986 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 37 treesize of output 29 [2018-11-10 04:07:08,989 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 14 treesize of output 1 [2018-11-10 04:07:08,989 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:08,992 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:08,995 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 39 treesize of output 23 [2018-11-10 04:07:08,998 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:07:08,999 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:07:08,999 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 23 treesize of output 13 [2018-11-10 04:07:08,999 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:09,003 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:09,015 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:09,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:09,034 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-10 04:07:09,034 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:128, output treesize:10 [2018-11-10 04:07:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 04:07:09,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 04:07:09,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 8] total 19 [2018-11-10 04:07:09,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 04:07:09,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 04:07:09,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-11-10 04:07:09,114 INFO L87 Difference]: Start difference. First operand 1215 states and 1807 transitions. Second operand 19 states. [2018-11-10 04:07:40,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:07:40,591 INFO L93 Difference]: Finished difference Result 7439 states and 10992 transitions. [2018-11-10 04:07:40,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 04:07:40,592 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 204 [2018-11-10 04:07:40,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:07:40,596 INFO L225 Difference]: With dead ends: 7439 [2018-11-10 04:07:40,596 INFO L226 Difference]: Without dead ends: 6275 [2018-11-10 04:07:40,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 797 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=252, Invalid=804, Unknown=0, NotChecked=0, Total=1056 [2018-11-10 04:07:40,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6275 states. [2018-11-10 04:07:40,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6275 to 1369. [2018-11-10 04:07:40,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1369 states. [2018-11-10 04:07:40,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2071 transitions. [2018-11-10 04:07:40,713 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2071 transitions. Word has length 204 [2018-11-10 04:07:40,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:07:40,713 INFO L481 AbstractCegarLoop]: Abstraction has 1369 states and 2071 transitions. [2018-11-10 04:07:40,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 04:07:40,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2071 transitions. [2018-11-10 04:07:40,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-10 04:07:40,714 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:07:40,715 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:07:40,715 INFO L424 AbstractCegarLoop]: === Iteration 123 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:07:40,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:07:40,715 INFO L82 PathProgramCache]: Analyzing trace with hash -622982657, now seen corresponding path program 1 times [2018-11-10 04:07:40,715 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:07:40,715 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 126 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 126 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:07:40,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:07:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:07:46,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:07:46,095 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 5 treesize of output 1 [2018-11-10 04:07:46,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:46,138 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-10 04:07:46,142 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-10 04:07:46,143 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:46,147 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:46,184 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 23 treesize of output 20 [2018-11-10 04:07:46,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 04:07:46,192 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:46,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 04:07:46,200 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:46,202 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:46,204 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:46,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 04:07:46,211 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:46,225 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:46,235 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:46,245 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:46,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:46,264 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:48, output treesize:14 [2018-11-10 04:07:46,305 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 107 treesize of output 78 [2018-11-10 04:07:46,310 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-10 04:07:46,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:46,333 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:46,349 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 77 treesize of output 53 [2018-11-10 04:07:46,352 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 22 treesize of output 21 [2018-11-10 04:07:46,352 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:46,371 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:46,381 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 42 treesize of output 47 [2018-11-10 04:07:46,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 04:07:46,434 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 04:07:46,455 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 04:07:46,477 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 04:07:46,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 04:07:46,533 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-10 04:07:46,533 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:119, output treesize:76 [2018-11-10 04:07:46,623 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 31 treesize of output 28 [2018-11-10 04:07:46,625 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 28 treesize of output 27 [2018-11-10 04:07:46,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:46,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:46,644 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 49 treesize of output 33 [2018-11-10 04:07:46,647 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 33 treesize of output 9 [2018-11-10 04:07:46,647 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:46,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:46,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:46,662 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:21 [2018-11-10 04:07:46,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 8 treesize of output 6 [2018-11-10 04:07:46,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 6 treesize of output 4 [2018-11-10 04:07:46,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:46,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:46,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:46,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:13 [2018-11-10 04:07:46,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 17 treesize of output 13 [2018-11-10 04:07:46,708 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-10 04:07:46,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:46,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:46,710 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-10 04:07:46,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:07:46,785 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 100 proven. 120 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 04:07:46,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:07:46,847 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 128 treesize of output 100 [2018-11-10 04:07:46,852 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-10 04:07:46,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:46,872 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:46,879 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 99 treesize of output 74 [2018-11-10 04:07:46,950 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:07:47,001 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 32 treesize of output 54 [2018-11-10 04:07:47,002 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 04:07:47,046 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 39 treesize of output 23 [2018-11-10 04:07:47,049 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:07:47,049 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:07:47,050 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 23 treesize of output 13 [2018-11-10 04:07:47,050 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:47,055 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:47,058 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 37 treesize of output 29 [2018-11-10 04:07:47,061 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 14 treesize of output 1 [2018-11-10 04:07:47,061 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:47,064 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:47,074 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:47,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:47,094 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-10 04:07:47,094 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:128, output treesize:10 [2018-11-10 04:07:47,223 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 04:07:47,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:07:47,229 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:07:47,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:07:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:07:47,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:07:47,563 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 5 treesize of output 1 [2018-11-10 04:07:47,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:47,632 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 23 treesize of output 20 [2018-11-10 04:07:47,637 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 04:07:47,642 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:47,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 04:07:47,654 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:47,657 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:47,661 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:47,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 04:07:47,676 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:47,706 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:47,728 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:47,748 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:47,805 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 23 treesize of output 20 [2018-11-10 04:07:47,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 04:07:47,818 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:47,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 04:07:47,831 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:47,833 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:47,835 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:47,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 04:07:47,844 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:47,873 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:47,889 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:47,901 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:47,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:47,931 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:58, output treesize:23 [2018-11-10 04:07:48,055 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 107 treesize of output 78 [2018-11-10 04:07:48,059 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-10 04:07:48,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:48,086 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:48,107 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 77 treesize of output 53 [2018-11-10 04:07:48,111 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 22 treesize of output 21 [2018-11-10 04:07:48,111 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:48,126 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:48,134 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 42 treesize of output 47 [2018-11-10 04:07:48,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 04:07:48,194 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 04:07:48,212 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 04:07:48,230 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 04:07:48,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 04:07:48,282 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-10 04:07:48,282 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:126, output treesize:90 [2018-11-10 04:07:48,368 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 31 treesize of output 28 [2018-11-10 04:07:48,371 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 28 treesize of output 27 [2018-11-10 04:07:48,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:48,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:48,388 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 49 treesize of output 33 [2018-11-10 04:07:48,389 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 33 treesize of output 9 [2018-11-10 04:07:48,390 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:48,392 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:48,402 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 7 treesize of output 5 [2018-11-10 04:07:48,402 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:48,411 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 8 treesize of output 6 [2018-11-10 04:07:48,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 6 treesize of output 4 [2018-11-10 04:07:48,412 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:48,413 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:48,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:48,419 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:71, output treesize:13 [2018-11-10 04:07:48,422 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 13 [2018-11-10 04:07:48,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 13 treesize of output 5 [2018-11-10 04:07:48,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:48,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:48,425 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-10 04:07:48,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:07:48,521 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 96 proven. 124 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 04:07:48,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:07:48,575 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 126 treesize of output 98 [2018-11-10 04:07:48,580 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-10 04:07:48,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:48,603 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:07:48,612 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 97 treesize of output 72 [2018-11-10 04:07:48,687 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:07:48,746 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 32 treesize of output 54 [2018-11-10 04:07:48,746 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 04:07:48,780 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 39 treesize of output 23 [2018-11-10 04:07:48,783 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:07:48,784 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:07:48,784 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 23 treesize of output 13 [2018-11-10 04:07:48,785 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:48,788 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:48,792 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 37 treesize of output 29 [2018-11-10 04:07:48,795 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 14 treesize of output 1 [2018-11-10 04:07:48,795 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 04:07:48,798 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:48,811 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:48,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:07:48,830 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-10 04:07:48,830 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:126, output treesize:10 [2018-11-10 04:07:48,892 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 04:07:48,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 04:07:48,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 8] total 19 [2018-11-10 04:07:48,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 04:07:48,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 04:07:48,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-11-10 04:07:48,913 INFO L87 Difference]: Start difference. First operand 1369 states and 2071 transitions. Second operand 19 states. [2018-11-10 04:08:05,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:08:05,971 INFO L93 Difference]: Finished difference Result 7037 states and 10522 transitions. [2018-11-10 04:08:05,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 04:08:05,971 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 205 [2018-11-10 04:08:05,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:08:05,976 INFO L225 Difference]: With dead ends: 7037 [2018-11-10 04:08:05,977 INFO L226 Difference]: Without dead ends: 5719 [2018-11-10 04:08:05,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 829 GetRequests, 799 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2018-11-10 04:08:05,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5719 states. [2018-11-10 04:08:06,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5719 to 1363. [2018-11-10 04:08:06,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2018-11-10 04:08:06,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2061 transitions. [2018-11-10 04:08:06,111 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2061 transitions. Word has length 205 [2018-11-10 04:08:06,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:08:06,111 INFO L481 AbstractCegarLoop]: Abstraction has 1363 states and 2061 transitions. [2018-11-10 04:08:06,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 04:08:06,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2061 transitions. [2018-11-10 04:08:06,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-11-10 04:08:06,113 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:08:06,113 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:08:06,113 INFO L424 AbstractCegarLoop]: === Iteration 124 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:08:06,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:08:06,114 INFO L82 PathProgramCache]: Analyzing trace with hash 2143906995, now seen corresponding path program 1 times [2018-11-10 04:08:06,114 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:08:06,114 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/cvc4nyu Starting monitored process 128 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 128 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:08:06,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:08:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:08:16,868 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 04:08:16,888 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:08:16,889 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:08:16,889 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:08:16,889 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:08:16,890 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:08:16,890 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:08:16,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:08:16 BoogieIcfgContainer [2018-11-10 04:08:16,962 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 04:08:16,963 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:08:16,963 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:08:16,963 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:08:16,963 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:59:28" (3/4) ... [2018-11-10 04:08:16,965 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 04:08:16,979 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:08:16,979 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:08:16,979 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:08:16,979 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:08:16,979 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:08:16,979 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:08:17,043 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c9a3b790-f0f2-4e04-8b58-651b0ef967ed/bin-2019/utaipan/witness.graphml [2018-11-10 04:08:17,043 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:08:17,043 INFO L168 Benchmark]: Toolchain (without parser) took 532764.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 947.9 MB in the beginning and 878.2 MB in the end (delta: 69.7 MB). Peak memory consumption was 231.2 MB. Max. memory is 11.5 GB. [2018-11-10 04:08:17,044 INFO L168 Benchmark]: CDTParser took 0.18 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-10 04:08:17,044 INFO L168 Benchmark]: CACSL2BoogieTranslator took 820.27 ms. Allocated memory is still 1.0 GB. Free memory was 947.9 MB in the beginning and 776.1 MB in the end (delta: 171.8 MB). Peak memory consumption was 171.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:08:17,044 INFO L168 Benchmark]: Boogie Procedure Inliner took 130.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 776.1 MB in the beginning and 1.1 GB in the end (delta: -371.6 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2018-11-10 04:08:17,044 INFO L168 Benchmark]: Boogie Preprocessor took 75.10 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: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. [2018-11-10 04:08:17,044 INFO L168 Benchmark]: RCFGBuilder took 3264.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 975.8 MB in the end (delta: 160.4 MB). Peak memory consumption was 160.4 MB. Max. memory is 11.5 GB. [2018-11-10 04:08:17,045 INFO L168 Benchmark]: TraceAbstraction took 528389.93 ms. Allocated memory is still 1.2 GB. Free memory was 975.8 MB in the beginning and 897.6 MB in the end (delta: 78.2 MB). Peak memory consumption was 78.2 MB. Max. memory is 11.5 GB. [2018-11-10 04:08:17,045 INFO L168 Benchmark]: Witness Printer took 79.99 ms. Allocated memory is still 1.2 GB. Free memory was 897.6 MB in the beginning and 878.2 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2018-11-10 04:08:17,046 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 820.27 ms. Allocated memory is still 1.0 GB. Free memory was 947.9 MB in the beginning and 776.1 MB in the end (delta: 171.8 MB). Peak memory consumption was 171.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 130.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 776.1 MB in the beginning and 1.1 GB in the end (delta: -371.6 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.10 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: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3264.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 975.8 MB in the end (delta: 160.4 MB). Peak memory consumption was 160.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 528389.93 ms. Allocated memory is still 1.2 GB. Free memory was 975.8 MB in the beginning and 897.6 MB in the end (delta: 78.2 MB). Peak memory consumption was 78.2 MB. Max. memory is 11.5 GB. * Witness Printer took 79.99 ms. Allocated memory is still 1.2 GB. Free memory was 897.6 MB in the beginning and 878.2 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1750]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] CALL static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1065] SSL *s ; [L1066] int tmp ; [L1070] EXPR, FCALL malloc(sizeof(SSL)) [L1070] s = malloc(sizeof(SSL)) [L1071] EXPR, FCALL malloc(sizeof(struct ssl3_state_st)) [L1071] CALL s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1071] RET s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] EXPR, FCALL malloc(sizeof(SSL_CTX)) [L1072] CALL s->ctx = malloc(sizeof(SSL_CTX)) [L1072] RET s->ctx = malloc(sizeof(SSL_CTX)) [L1073] EXPR, FCALL malloc(sizeof(SSL_SESSION)) [L1073] CALL s->session = malloc(sizeof(SSL_SESSION)) [L1073] RET s->session = malloc(sizeof(SSL_SESSION)) [L1074] CALL ssl3_accept(s) VAL [init=1, SSLv3_server_data={1471789951:0}] [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] CALL s->state = 8464 [L1105] RET s->state = 8464 [L1106] blastFlag = 0 [L1107] CALL s->hit=__VERIFIER_nondet_int () [L1107] RET s->hit=__VERIFIER_nondet_int () [L1108] CALL s->state = 8464 [L1108] RET s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] CALL, EXPR s->info_callback [L1115] RET, EXPR s->info_callback [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] CALL, EXPR s->info_callback [L1116] RET, EXPR s->info_callback [L1116] cb = s->info_callback [L1120] CALL, EXPR s->in_handshake [L1120] RET, EXPR s->in_handshake [L1120] CALL s->in_handshake += 1 [L1120] RET s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={1471789951:0}] [L1130] CALL, EXPR s->cert [L1130] RET, EXPR s->cert [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1471789951:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND TRUE s->state == 8464 [L1323] CALL s->shutdown = 0 [L1323] RET s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={1471789951:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] CALL s->state = 8496 [L1336] RET s->state = 8496 [L1337] CALL s->init_num = 0 [L1337] RET s->init_num = 0 [L1709] CALL, EXPR s->s3 [L1709] RET, EXPR s->s3 [L1709] CALL, EXPR (s->s3)->tmp.reuse_message [L1709] RET, EXPR (s->s3)->tmp.reuse_message [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [init=1, SSLv3_server_data={1471789951:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1471789951:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={1471789951:0}] [L1347] COND FALSE !(ret <= 0) [L1352] CALL s->hit [L1352] RET s->hit [L1352] COND TRUE s->hit [L1353] CALL s->state = 8656 [L1353] RET s->state = 8656 [L1357] CALL s->init_num = 0 [L1357] RET s->init_num = 0 [L1709] CALL, EXPR s->s3 [L1709] RET, EXPR s->s3 [L1709] CALL, EXPR (s->s3)->tmp.reuse_message [L1709] RET, EXPR (s->s3)->tmp.reuse_message [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [init=1, SSLv3_server_data={1471789951:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1471789951:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] CALL, EXPR s->state [L1205] RET, EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] CALL, EXPR s->state [L1208] RET, EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] CALL, EXPR s->state [L1211] RET, EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] CALL, EXPR s->state [L1214] RET, EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] CALL, EXPR s->state [L1217] RET, EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] CALL, EXPR s->state [L1220] RET, EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] CALL, EXPR s->state [L1223] RET, EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] CALL, EXPR s->state [L1226] RET, EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] CALL, EXPR s->state [L1229] RET, EXPR s->state [L1229] COND TRUE s->state == 8656 [L1594] CALL, EXPR s->session [L1594] RET, EXPR s->session [L1594] CALL, EXPR s->s3 [L1594] RET, EXPR s->s3 [L1594] CALL, EXPR (s->s3)->tmp.new_cipher [L1594] RET, EXPR (s->s3)->tmp.new_cipher [L1594] CALL (s->session)->cipher = (s->s3)->tmp.new_cipher [L1594] RET (s->session)->cipher = (s->s3)->tmp.new_cipher [L1595] COND FALSE !(! tmp___9) [L1601] ret = __VERIFIER_nondet_int() [L1602] COND FALSE !(blastFlag == 10) VAL [init=1, SSLv3_server_data={1471789951:0}] [L1605] COND FALSE !(blastFlag == 13) VAL [init=1, SSLv3_server_data={1471789951:0}] [L1611] COND FALSE !(ret <= 0) [L1616] CALL s->state = 8672 [L1616] RET s->state = 8672 [L1617] CALL s->init_num = 0 [L1617] RET s->init_num = 0 [L1618] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={1471789951:0}] [L1709] CALL, EXPR s->s3 [L1709] RET, EXPR s->s3 [L1709] CALL, EXPR (s->s3)->tmp.reuse_message [L1709] RET, EXPR (s->s3)->tmp.reuse_message [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [init=1, SSLv3_server_data={1471789951:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1471789951:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] CALL, EXPR s->state [L1205] RET, EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] CALL, EXPR s->state [L1208] RET, EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] CALL, EXPR s->state [L1211] RET, EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] CALL, EXPR s->state [L1214] RET, EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] CALL, EXPR s->state [L1217] RET, EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] CALL, EXPR s->state [L1220] RET, EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] CALL, EXPR s->state [L1223] RET, EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] CALL, EXPR s->state [L1226] RET, EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] CALL, EXPR s->state [L1229] RET, EXPR s->state [L1229] COND FALSE !(s->state == 8656) [L1232] CALL, EXPR s->state [L1232] RET, EXPR s->state [L1232] COND FALSE !(s->state == 8657) [L1235] CALL, EXPR s->state [L1235] RET, EXPR s->state [L1235] COND TRUE s->state == 8672 [L1627] ret = __VERIFIER_nondet_int() [L1628] COND FALSE !(blastFlag == 11) VAL [init=1, SSLv3_server_data={1471789951:0}] [L1631] COND FALSE !(blastFlag == 14) VAL [init=1, SSLv3_server_data={1471789951:0}] [L1637] COND FALSE !(ret <= 0) [L1642] CALL s->state = 8448 [L1642] RET s->state = 8448 [L1643] CALL s->hit [L1643] RET s->hit [L1643] COND TRUE s->hit [L1644] CALL, EXPR s->s3 [L1644] RET, EXPR s->s3 [L1644] CALL (s->s3)->tmp.next_state = 8640 [L1644] RET (s->s3)->tmp.next_state = 8640 [L1648] CALL s->init_num = 0 [L1648] RET s->init_num = 0 [L1709] CALL, EXPR s->s3 [L1709] RET, EXPR s->s3 [L1709] CALL, EXPR (s->s3)->tmp.reuse_message [L1709] RET, EXPR (s->s3)->tmp.reuse_message [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [init=1, SSLv3_server_data={1471789951:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1471789951:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={1471789951:0}] [L1503] CALL, EXPR s->s3 [L1503] RET, EXPR s->s3 [L1503] CALL, EXPR (s->s3)->tmp.next_state [L1503] RET, EXPR (s->s3)->tmp.next_state [L1503] CALL s->state = (s->s3)->tmp.next_state [L1503] RET s->state = (s->s3)->tmp.next_state [L1709] CALL, EXPR s->s3 [L1709] RET, EXPR s->s3 [L1709] CALL, EXPR (s->s3)->tmp.reuse_message [L1709] RET, EXPR (s->s3)->tmp.reuse_message [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [init=1, SSLv3_server_data={1471789951:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1471789951:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] CALL, EXPR s->state [L1205] RET, EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] CALL, EXPR s->state [L1208] RET, EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] CALL, EXPR s->state [L1211] RET, EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] CALL, EXPR s->state [L1214] RET, EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] CALL, EXPR s->state [L1217] RET, EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] CALL, EXPR s->state [L1220] RET, EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] CALL, EXPR s->state [L1223] RET, EXPR s->state [L1223] COND TRUE s->state == 8640 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND FALSE !(blastFlag == 9) VAL [init=1, SSLv3_server_data={1471789951:0}] [L1574] COND FALSE !(blastFlag == 12) VAL [init=1, SSLv3_server_data={1471789951:0}] [L1750] __VERIFIER_error() VAL [init=1, SSLv3_server_data={1471789951:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 1 error locations. UNSAFE Result, 528.3s OverallTime, 124 OverallIterations, 8 TraceHistogramMax, 365.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 23289 SDtfs, 47261 SDslu, 59083 SDs, 0 SdLazy, 51787 SolverSat, 4585 SolverUnsat, 124 SolverUnknown, 0 SolverNotchecked, 337.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19441 GetRequests, 18610 SyntacticMatches, 5 SemanticMatches, 826 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1369occurred in iteration=122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.9s AutomataMinimizationTime, 123 MinimizatonAttempts, 20858 StatesRemovedByMinimization, 121 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 4.3s SsaConstructionTime, 97.1s SatisfiabilityAnalysisTime, 47.1s InterpolantComputationTime, 16143 NumberOfCodeBlocks, 16143 NumberOfCodeBlocksAsserted, 127 NumberOfCheckSat, 19077 ConstructedInterpolants, 168 QuantifiedInterpolants, 14661527 SizeOfPredicates, 2154 NumberOfNonLiveVariables, 98512 ConjunctsInSsa, 2356 ConjunctsInUnsatCore, 145 InterpolantComputations, 120 PerfectInterpolantSequences, 19266/21315 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...