./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.06_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_95d82300-5d3b-4c9b-bd6d-1460eee38aad/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.06_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 12b9509fef02d71cc2f0a70f9270a898a3e1b6a5 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_95d82300-5d3b-4c9b-bd6d-1460eee38aad/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.06_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 12b9509fef02d71cc2f0a70f9270a898a3e1b6a5 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 10:29:41,786 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:29:41,787 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:29:41,795 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:29:41,795 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:29:41,796 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:29:41,797 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:29:41,798 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:29:41,799 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:29:41,799 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:29:41,800 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:29:41,800 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:29:41,801 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:29:41,801 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:29:41,802 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:29:41,803 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:29:41,803 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:29:41,805 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:29:41,806 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:29:41,807 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:29:41,808 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:29:41,808 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:29:41,810 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:29:41,810 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:29:41,810 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:29:41,811 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:29:41,812 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:29:41,812 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:29:41,813 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:29:41,813 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:29:41,814 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:29:41,814 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:29:41,814 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:29:41,814 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:29:41,815 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:29:41,815 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:29:41,816 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 10:29:41,823 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:29:41,823 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:29:41,824 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:29:41,824 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 10:29:41,824 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 10:29:41,824 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 10:29:41,824 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 10:29:41,824 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 10:29:41,825 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 10:29:41,825 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 10:29:41,825 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 10:29:41,825 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:29:41,825 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:29:41,826 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:29:41,826 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:29:41,826 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:29:41,826 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 10:29:41,826 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:29:41,826 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 10:29:41,826 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:29:41,827 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:29:41,827 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 10:29:41,827 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:29:41,827 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:29:41,827 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:29:41,827 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 10:29:41,827 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:29:41,828 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:29:41,828 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:29:41,828 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 10:29:41,828 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 10:29:41,828 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:29:41,828 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 10:29:41,828 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 10:29:41,828 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_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 -> 12b9509fef02d71cc2f0a70f9270a898a3e1b6a5 [2018-11-10 10:29:41,850 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:29:41,858 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:29:41,860 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:29:41,860 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:29:41,861 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:29:41,861 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.06_false-unreach-call.i.cil.c [2018-11-10 10:29:41,896 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/bin-2019/utaipan/data/2a868fb76/77b445a5b4844953ac30601c028eeeb2/FLAGaa75b947a [2018-11-10 10:29:42,253 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:29:42,253 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/sv-benchmarks/c/ssh/s3_srvr.blast.06_false-unreach-call.i.cil.c [2018-11-10 10:29:42,266 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/bin-2019/utaipan/data/2a868fb76/77b445a5b4844953ac30601c028eeeb2/FLAGaa75b947a [2018-11-10 10:29:42,277 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/bin-2019/utaipan/data/2a868fb76/77b445a5b4844953ac30601c028eeeb2 [2018-11-10 10:29:42,279 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:29:42,279 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:29:42,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:29:42,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:29:42,282 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:29:42,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:29:42" (1/1) ... [2018-11-10 10:29:42,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39819167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:29:42, skipping insertion in model container [2018-11-10 10:29:42,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:29:42" (1/1) ... [2018-11-10 10:29:42,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:29:42,329 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:29:42,720 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:29:42,727 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:29:43,002 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:29:43,016 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:29:43,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:29:43 WrapperNode [2018-11-10 10:29:43,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:29:43,017 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:29:43,017 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:29:43,017 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:29:43,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:29:43" (1/1) ... [2018-11-10 10:29:43,041 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:29:43" (1/1) ... [2018-11-10 10:29:43,086 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:29:43,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:29:43,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:29:43,087 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:29:43,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:29:43" (1/1) ... [2018-11-10 10:29:43,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:29:43" (1/1) ... [2018-11-10 10:29:43,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:29:43" (1/1) ... [2018-11-10 10:29:43,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:29:43" (1/1) ... [2018-11-10 10:29:43,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:29:43" (1/1) ... [2018-11-10 10:29:43,147 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:29:43" (1/1) ... [2018-11-10 10:29:43,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:29:43" (1/1) ... [2018-11-10 10:29:43,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:29:43,159 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:29:43,159 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:29:43,159 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:29:43,160 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:29:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:29:43,209 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 10:29:43,209 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 10:29:43,209 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-11-10 10:29:43,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-11-10 10:29:43,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 10:29:43,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 10:29:43,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:29:43,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:29:43,684 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 10:29:43,686 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 10:29:44,168 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:29:44,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:29:44 BoogieIcfgContainer [2018-11-10 10:29:44,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:29:44,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 10:29:44,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 10:29:44,171 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 10:29:44,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:29:42" (1/3) ... [2018-11-10 10:29:44,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d88a2db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:29:44, skipping insertion in model container [2018-11-10 10:29:44,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:29:43" (2/3) ... [2018-11-10 10:29:44,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d88a2db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:29:44, skipping insertion in model container [2018-11-10 10:29:44,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:29:44" (3/3) ... [2018-11-10 10:29:44,174 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.06_false-unreach-call.i.cil.c [2018-11-10 10:29:44,179 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 10:29:44,185 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 10:29:44,195 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 10:29:44,216 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 10:29:44,217 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 10:29:44,217 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 10:29:44,217 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:29:44,217 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:29:44,217 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 10:29:44,217 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:29:44,217 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 10:29:44,231 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states. [2018-11-10 10:29:44,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-10 10:29:44,238 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:44,238 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, 1, 1] [2018-11-10 10:29:44,240 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:44,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:44,245 INFO L82 PathProgramCache]: Analyzing trace with hash -264402800, now seen corresponding path program 1 times [2018-11-10 10:29:44,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:44,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:44,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:44,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:44,281 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:44,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:44,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:44,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:44,510 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:44,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:44,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:44,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:44,527 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 4 states. [2018-11-10 10:29:44,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:44,876 INFO L93 Difference]: Finished difference Result 358 states and 605 transitions. [2018-11-10 10:29:44,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:44,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-11-10 10:29:44,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:44,885 INFO L225 Difference]: With dead ends: 358 [2018-11-10 10:29:44,885 INFO L226 Difference]: Without dead ends: 182 [2018-11-10 10:29:44,888 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 10:29:44,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-10 10:29:44,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2018-11-10 10:29:44,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-10 10:29:44,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 256 transitions. [2018-11-10 10:29:44,918 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 256 transitions. Word has length 51 [2018-11-10 10:29:44,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:44,919 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 256 transitions. [2018-11-10 10:29:44,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:44,919 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 256 transitions. [2018-11-10 10:29:44,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 10:29:44,921 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:44,921 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, 1, 1] [2018-11-10 10:29:44,921 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:44,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:44,922 INFO L82 PathProgramCache]: Analyzing trace with hash -311734117, now seen corresponding path program 1 times [2018-11-10 10:29:44,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:44,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:44,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:44,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:44,923 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:45,050 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 10:29:45,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:45,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:45,051 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:45,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:45,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:45,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:45,053 INFO L87 Difference]: Start difference. First operand 165 states and 256 transitions. Second operand 4 states. [2018-11-10 10:29:45,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:45,348 INFO L93 Difference]: Finished difference Result 378 states and 591 transitions. [2018-11-10 10:29:45,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:45,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-11-10 10:29:45,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:45,351 INFO L225 Difference]: With dead ends: 378 [2018-11-10 10:29:45,351 INFO L226 Difference]: Without dead ends: 239 [2018-11-10 10:29:45,353 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 10:29:45,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-11-10 10:29:45,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 198. [2018-11-10 10:29:45,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-11-10 10:29:45,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 315 transitions. [2018-11-10 10:29:45,367 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 315 transitions. Word has length 65 [2018-11-10 10:29:45,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:45,367 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 315 transitions. [2018-11-10 10:29:45,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:45,367 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 315 transitions. [2018-11-10 10:29:45,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 10:29:45,369 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:45,369 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, 1] [2018-11-10 10:29:45,369 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:45,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:45,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1166381172, now seen corresponding path program 1 times [2018-11-10 10:29:45,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:45,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:45,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:45,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:45,372 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:45,458 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 10:29:45,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:45,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:45,459 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:45,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:45,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:45,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:45,460 INFO L87 Difference]: Start difference. First operand 198 states and 315 transitions. Second operand 4 states. [2018-11-10 10:29:45,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:45,784 INFO L93 Difference]: Finished difference Result 505 states and 807 transitions. [2018-11-10 10:29:45,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:45,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-11-10 10:29:45,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:45,786 INFO L225 Difference]: With dead ends: 505 [2018-11-10 10:29:45,786 INFO L226 Difference]: Without dead ends: 333 [2018-11-10 10:29:45,787 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 10:29:45,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-11-10 10:29:45,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 239. [2018-11-10 10:29:45,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-11-10 10:29:45,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 389 transitions. [2018-11-10 10:29:45,796 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 389 transitions. Word has length 66 [2018-11-10 10:29:45,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:45,796 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 389 transitions. [2018-11-10 10:29:45,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:45,797 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 389 transitions. [2018-11-10 10:29:45,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 10:29:45,797 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:45,798 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, 1, 1] [2018-11-10 10:29:45,798 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:45,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:45,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1467533643, now seen corresponding path program 1 times [2018-11-10 10:29:45,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:45,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:45,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:45,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:45,799 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:45,906 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 10:29:45,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:45,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:45,907 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:45,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:45,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:45,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:45,908 INFO L87 Difference]: Start difference. First operand 239 states and 389 transitions. Second operand 4 states. [2018-11-10 10:29:46,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:46,285 INFO L93 Difference]: Finished difference Result 586 states and 954 transitions. [2018-11-10 10:29:46,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:46,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-11-10 10:29:46,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:46,286 INFO L225 Difference]: With dead ends: 586 [2018-11-10 10:29:46,287 INFO L226 Difference]: Without dead ends: 373 [2018-11-10 10:29:46,287 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 10:29:46,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-11-10 10:29:46,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 280. [2018-11-10 10:29:46,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-11-10 10:29:46,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 464 transitions. [2018-11-10 10:29:46,297 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 464 transitions. Word has length 67 [2018-11-10 10:29:46,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:46,298 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 464 transitions. [2018-11-10 10:29:46,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:46,298 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 464 transitions. [2018-11-10 10:29:46,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-10 10:29:46,299 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:46,299 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, 1, 1] [2018-11-10 10:29:46,299 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:46,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:46,299 INFO L82 PathProgramCache]: Analyzing trace with hash -868848703, now seen corresponding path program 1 times [2018-11-10 10:29:46,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:46,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:46,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:46,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:46,300 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:46,377 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 10:29:46,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:46,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:46,378 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:46,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:46,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:46,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:46,381 INFO L87 Difference]: Start difference. First operand 280 states and 464 transitions. Second operand 4 states. [2018-11-10 10:29:46,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:46,588 INFO L93 Difference]: Finished difference Result 551 states and 912 transitions. [2018-11-10 10:29:46,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:46,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-11-10 10:29:46,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:46,590 INFO L225 Difference]: With dead ends: 551 [2018-11-10 10:29:46,590 INFO L226 Difference]: Without dead ends: 297 [2018-11-10 10:29:46,590 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 10:29:46,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-11-10 10:29:46,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 280. [2018-11-10 10:29:46,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-11-10 10:29:46,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 463 transitions. [2018-11-10 10:29:46,598 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 463 transitions. Word has length 95 [2018-11-10 10:29:46,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:46,598 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 463 transitions. [2018-11-10 10:29:46,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:46,598 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 463 transitions. [2018-11-10 10:29:46,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-10 10:29:46,600 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:46,600 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, 1, 1] [2018-11-10 10:29:46,600 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:46,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:46,600 INFO L82 PathProgramCache]: Analyzing trace with hash 2104109530, now seen corresponding path program 1 times [2018-11-10 10:29:46,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:46,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:46,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:46,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:46,602 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:46,678 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 10:29:46,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:46,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:46,678 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:46,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:46,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:46,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:46,679 INFO L87 Difference]: Start difference. First operand 280 states and 463 transitions. Second operand 4 states. [2018-11-10 10:29:46,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:46,917 INFO L93 Difference]: Finished difference Result 705 states and 1171 transitions. [2018-11-10 10:29:46,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:46,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-11-10 10:29:46,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:46,919 INFO L225 Difference]: With dead ends: 705 [2018-11-10 10:29:46,920 INFO L226 Difference]: Without dead ends: 451 [2018-11-10 10:29:46,920 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 10:29:46,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-11-10 10:29:46,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 346. [2018-11-10 10:29:46,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-11-10 10:29:46,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 581 transitions. [2018-11-10 10:29:46,932 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 581 transitions. Word has length 96 [2018-11-10 10:29:46,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:46,933 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 581 transitions. [2018-11-10 10:29:46,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:46,933 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 581 transitions. [2018-11-10 10:29:46,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-10 10:29:46,934 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:46,934 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, 1, 1] [2018-11-10 10:29:46,934 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:46,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:46,935 INFO L82 PathProgramCache]: Analyzing trace with hash -510869019, now seen corresponding path program 1 times [2018-11-10 10:29:46,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:46,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:46,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:46,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:46,939 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:47,004 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 10:29:47,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:47,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:47,005 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:47,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:47,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:47,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:47,005 INFO L87 Difference]: Start difference. First operand 346 states and 581 transitions. Second operand 4 states. [2018-11-10 10:29:47,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:47,286 INFO L93 Difference]: Finished difference Result 681 states and 1145 transitions. [2018-11-10 10:29:47,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:47,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-11-10 10:29:47,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:47,288 INFO L225 Difference]: With dead ends: 681 [2018-11-10 10:29:47,288 INFO L226 Difference]: Without dead ends: 361 [2018-11-10 10:29:47,289 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 10:29:47,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-11-10 10:29:47,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 346. [2018-11-10 10:29:47,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-11-10 10:29:47,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 580 transitions. [2018-11-10 10:29:47,298 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 580 transitions. Word has length 96 [2018-11-10 10:29:47,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:47,298 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 580 transitions. [2018-11-10 10:29:47,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:47,298 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 580 transitions. [2018-11-10 10:29:47,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 10:29:47,299 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:47,300 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, 1, 1] [2018-11-10 10:29:47,300 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:47,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:47,300 INFO L82 PathProgramCache]: Analyzing trace with hash 914363844, now seen corresponding path program 1 times [2018-11-10 10:29:47,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:47,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:47,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:47,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:47,301 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:47,378 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 10:29:47,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:47,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:29:47,378 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:47,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:29:47,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:29:47,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:29:47,379 INFO L87 Difference]: Start difference. First operand 346 states and 580 transitions. Second operand 3 states. [2018-11-10 10:29:47,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:47,473 INFO L93 Difference]: Finished difference Result 982 states and 1665 transitions. [2018-11-10 10:29:47,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:29:47,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-10 10:29:47,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:47,475 INFO L225 Difference]: With dead ends: 982 [2018-11-10 10:29:47,476 INFO L226 Difference]: Without dead ends: 662 [2018-11-10 10:29:47,476 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 10:29:47,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2018-11-10 10:29:47,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 660. [2018-11-10 10:29:47,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-10 10:29:47,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1098 transitions. [2018-11-10 10:29:47,494 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1098 transitions. Word has length 102 [2018-11-10 10:29:47,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:47,494 INFO L481 AbstractCegarLoop]: Abstraction has 660 states and 1098 transitions. [2018-11-10 10:29:47,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:29:47,494 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1098 transitions. [2018-11-10 10:29:47,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 10:29:47,496 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:47,496 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, 1, 1] [2018-11-10 10:29:47,496 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:47,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:47,496 INFO L82 PathProgramCache]: Analyzing trace with hash 16970566, now seen corresponding path program 1 times [2018-11-10 10:29:47,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:47,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:47,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:47,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:47,497 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:47,610 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 10:29:47,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:47,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:47,611 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:47,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:47,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:47,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:47,612 INFO L87 Difference]: Start difference. First operand 660 states and 1098 transitions. Second operand 4 states. [2018-11-10 10:29:47,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:47,979 INFO L93 Difference]: Finished difference Result 1557 states and 2555 transitions. [2018-11-10 10:29:47,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:47,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-11-10 10:29:47,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:47,982 INFO L225 Difference]: With dead ends: 1557 [2018-11-10 10:29:47,982 INFO L226 Difference]: Without dead ends: 923 [2018-11-10 10:29:47,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 10:29:47,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2018-11-10 10:29:47,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 736. [2018-11-10 10:29:47,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-11-10 10:29:47,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1232 transitions. [2018-11-10 10:29:47,994 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1232 transitions. Word has length 102 [2018-11-10 10:29:47,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:47,994 INFO L481 AbstractCegarLoop]: Abstraction has 736 states and 1232 transitions. [2018-11-10 10:29:47,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:47,994 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1232 transitions. [2018-11-10 10:29:47,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-10 10:29:47,995 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:47,995 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, 1, 1] [2018-11-10 10:29:47,996 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:47,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:47,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1063326823, now seen corresponding path program 1 times [2018-11-10 10:29:47,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:47,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:47,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:47,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:47,997 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:48,050 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 10:29:48,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:48,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:48,051 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:48,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:48,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:48,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:48,052 INFO L87 Difference]: Start difference. First operand 736 states and 1232 transitions. Second operand 4 states. [2018-11-10 10:29:48,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:48,315 INFO L93 Difference]: Finished difference Result 1627 states and 2677 transitions. [2018-11-10 10:29:48,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:48,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-11-10 10:29:48,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:48,317 INFO L225 Difference]: With dead ends: 1627 [2018-11-10 10:29:48,317 INFO L226 Difference]: Without dead ends: 917 [2018-11-10 10:29:48,319 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 10:29:48,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-11-10 10:29:48,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 736. [2018-11-10 10:29:48,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-11-10 10:29:48,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1228 transitions. [2018-11-10 10:29:48,330 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1228 transitions. Word has length 103 [2018-11-10 10:29:48,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:48,330 INFO L481 AbstractCegarLoop]: Abstraction has 736 states and 1228 transitions. [2018-11-10 10:29:48,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:48,330 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1228 transitions. [2018-11-10 10:29:48,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 10:29:48,332 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:48,332 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, 1, 1] [2018-11-10 10:29:48,332 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:48,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:48,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1912417701, now seen corresponding path program 1 times [2018-11-10 10:29:48,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:48,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:48,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:48,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:48,333 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:48,381 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 10:29:48,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:48,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:48,381 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:48,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:48,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:48,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:48,382 INFO L87 Difference]: Start difference. First operand 736 states and 1228 transitions. Second operand 4 states. [2018-11-10 10:29:48,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:48,562 INFO L93 Difference]: Finished difference Result 1460 states and 2438 transitions. [2018-11-10 10:29:48,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:48,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-11-10 10:29:48,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:48,564 INFO L225 Difference]: With dead ends: 1460 [2018-11-10 10:29:48,565 INFO L226 Difference]: Without dead ends: 750 [2018-11-10 10:29:48,565 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 10:29:48,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-11-10 10:29:48,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 736. [2018-11-10 10:29:48,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-11-10 10:29:48,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1227 transitions. [2018-11-10 10:29:48,576 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1227 transitions. Word has length 110 [2018-11-10 10:29:48,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:48,577 INFO L481 AbstractCegarLoop]: Abstraction has 736 states and 1227 transitions. [2018-11-10 10:29:48,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:48,577 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1227 transitions. [2018-11-10 10:29:48,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 10:29:48,578 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:48,578 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, 1, 1] [2018-11-10 10:29:48,578 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:48,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:48,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1917704391, now seen corresponding path program 1 times [2018-11-10 10:29:48,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:48,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:48,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:48,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:48,580 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:48,692 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 10:29:48,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:48,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:29:48,692 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:48,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:29:48,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:29:48,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:29:48,693 INFO L87 Difference]: Start difference. First operand 736 states and 1227 transitions. Second operand 5 states. [2018-11-10 10:29:49,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:49,024 INFO L93 Difference]: Finished difference Result 1466 states and 2446 transitions. [2018-11-10 10:29:49,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:29:49,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2018-11-10 10:29:49,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:49,026 INFO L225 Difference]: With dead ends: 1466 [2018-11-10 10:29:49,026 INFO L226 Difference]: Without dead ends: 756 [2018-11-10 10:29:49,027 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 10:29:49,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-11-10 10:29:49,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 754. [2018-11-10 10:29:49,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2018-11-10 10:29:49,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1237 transitions. [2018-11-10 10:29:49,039 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1237 transitions. Word has length 110 [2018-11-10 10:29:49,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:49,039 INFO L481 AbstractCegarLoop]: Abstraction has 754 states and 1237 transitions. [2018-11-10 10:29:49,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:29:49,040 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1237 transitions. [2018-11-10 10:29:49,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 10:29:49,041 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:49,041 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, 1, 1] [2018-11-10 10:29:49,041 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:49,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:49,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1452118287, now seen corresponding path program 1 times [2018-11-10 10:29:49,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:49,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:49,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:49,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:49,043 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:49,079 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 10:29:49,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:49,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:49,079 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:49,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:49,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:49,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:49,080 INFO L87 Difference]: Start difference. First operand 754 states and 1237 transitions. Second operand 4 states. [2018-11-10 10:29:49,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:49,355 INFO L93 Difference]: Finished difference Result 1743 states and 2824 transitions. [2018-11-10 10:29:49,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:49,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-11-10 10:29:49,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:49,358 INFO L225 Difference]: With dead ends: 1743 [2018-11-10 10:29:49,358 INFO L226 Difference]: Without dead ends: 1015 [2018-11-10 10:29:49,359 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 10:29:49,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2018-11-10 10:29:49,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 788. [2018-11-10 10:29:49,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2018-11-10 10:29:49,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1279 transitions. [2018-11-10 10:29:49,373 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1279 transitions. Word has length 110 [2018-11-10 10:29:49,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:49,374 INFO L481 AbstractCegarLoop]: Abstraction has 788 states and 1279 transitions. [2018-11-10 10:29:49,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:49,374 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1279 transitions. [2018-11-10 10:29:49,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-10 10:29:49,375 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:49,375 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, 1, 1] [2018-11-10 10:29:49,375 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:49,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:49,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1412356939, now seen corresponding path program 1 times [2018-11-10 10:29:49,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:49,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:49,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:49,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:49,377 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:49,410 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 10:29:49,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:49,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:49,411 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:49,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:49,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:49,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:49,411 INFO L87 Difference]: Start difference. First operand 788 states and 1279 transitions. Second operand 4 states. [2018-11-10 10:29:49,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:49,807 INFO L93 Difference]: Finished difference Result 1729 states and 2768 transitions. [2018-11-10 10:29:49,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:49,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2018-11-10 10:29:49,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:49,811 INFO L225 Difference]: With dead ends: 1729 [2018-11-10 10:29:49,811 INFO L226 Difference]: Without dead ends: 967 [2018-11-10 10:29:49,813 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 10:29:49,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2018-11-10 10:29:49,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 788. [2018-11-10 10:29:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2018-11-10 10:29:49,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1267 transitions. [2018-11-10 10:29:49,838 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1267 transitions. Word has length 111 [2018-11-10 10:29:49,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:49,838 INFO L481 AbstractCegarLoop]: Abstraction has 788 states and 1267 transitions. [2018-11-10 10:29:49,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:49,838 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1267 transitions. [2018-11-10 10:29:49,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 10:29:49,840 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:49,840 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, 1, 1, 1] [2018-11-10 10:29:49,840 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:49,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:49,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1530199105, now seen corresponding path program 1 times [2018-11-10 10:29:49,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:49,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:49,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:49,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:49,842 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:49,936 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 10:29:49,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:49,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:49,937 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:49,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:49,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:49,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:49,938 INFO L87 Difference]: Start difference. First operand 788 states and 1267 transitions. Second operand 4 states. [2018-11-10 10:29:50,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:50,488 INFO L93 Difference]: Finished difference Result 1811 states and 2880 transitions. [2018-11-10 10:29:50,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:50,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2018-11-10 10:29:50,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:50,492 INFO L225 Difference]: With dead ends: 1811 [2018-11-10 10:29:50,492 INFO L226 Difference]: Without dead ends: 1049 [2018-11-10 10:29:50,493 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 10:29:50,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2018-11-10 10:29:50,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 876. [2018-11-10 10:29:50,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2018-11-10 10:29:50,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1413 transitions. [2018-11-10 10:29:50,520 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1413 transitions. Word has length 113 [2018-11-10 10:29:50,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:50,520 INFO L481 AbstractCegarLoop]: Abstraction has 876 states and 1413 transitions. [2018-11-10 10:29:50,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:50,520 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1413 transitions. [2018-11-10 10:29:50,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-10 10:29:50,522 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:50,522 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, 1, 1, 1, 1] [2018-11-10 10:29:50,523 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:50,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:50,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1652681162, now seen corresponding path program 1 times [2018-11-10 10:29:50,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:50,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:50,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:50,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:50,524 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:50,594 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 10:29:50,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:50,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:50,595 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:50,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:50,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:50,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:50,595 INFO L87 Difference]: Start difference. First operand 876 states and 1413 transitions. Second operand 4 states. [2018-11-10 10:29:50,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:50,895 INFO L93 Difference]: Finished difference Result 1905 states and 3036 transitions. [2018-11-10 10:29:50,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:50,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2018-11-10 10:29:50,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:50,898 INFO L225 Difference]: With dead ends: 1905 [2018-11-10 10:29:50,898 INFO L226 Difference]: Without dead ends: 1051 [2018-11-10 10:29:50,899 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 10:29:50,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2018-11-10 10:29:50,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 880. [2018-11-10 10:29:50,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2018-11-10 10:29:50,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1419 transitions. [2018-11-10 10:29:50,915 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1419 transitions. Word has length 114 [2018-11-10 10:29:50,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:50,916 INFO L481 AbstractCegarLoop]: Abstraction has 880 states and 1419 transitions. [2018-11-10 10:29:50,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:50,916 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1419 transitions. [2018-11-10 10:29:50,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 10:29:50,917 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:50,918 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, 1, 1] [2018-11-10 10:29:50,918 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:50,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:50,918 INFO L82 PathProgramCache]: Analyzing trace with hash -945836914, now seen corresponding path program 1 times [2018-11-10 10:29:50,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:50,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:50,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:50,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:50,919 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:50,959 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 10:29:50,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:50,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:50,960 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:50,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:50,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:50,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:50,961 INFO L87 Difference]: Start difference. First operand 880 states and 1419 transitions. Second operand 4 states. [2018-11-10 10:29:51,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:51,220 INFO L93 Difference]: Finished difference Result 1991 states and 3176 transitions. [2018-11-10 10:29:51,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:51,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-11-10 10:29:51,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:51,223 INFO L225 Difference]: With dead ends: 1991 [2018-11-10 10:29:51,223 INFO L226 Difference]: Without dead ends: 1137 [2018-11-10 10:29:51,224 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 10:29:51,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2018-11-10 10:29:51,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 942. [2018-11-10 10:29:51,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2018-11-10 10:29:51,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1511 transitions. [2018-11-10 10:29:51,242 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1511 transitions. Word has length 124 [2018-11-10 10:29:51,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:51,242 INFO L481 AbstractCegarLoop]: Abstraction has 942 states and 1511 transitions. [2018-11-10 10:29:51,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:51,242 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1511 transitions. [2018-11-10 10:29:51,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:29:51,244 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:51,244 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, 1, 1] [2018-11-10 10:29:51,244 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:51,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:51,244 INFO L82 PathProgramCache]: Analyzing trace with hash 485272306, now seen corresponding path program 1 times [2018-11-10 10:29:51,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:51,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:51,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:51,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:51,246 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:51,288 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 10:29:51,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:51,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:51,288 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:51,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:51,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:51,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:51,289 INFO L87 Difference]: Start difference. First operand 942 states and 1511 transitions. Second operand 4 states. [2018-11-10 10:29:51,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:51,560 INFO L93 Difference]: Finished difference Result 2029 states and 3218 transitions. [2018-11-10 10:29:51,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:51,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2018-11-10 10:29:51,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:51,563 INFO L225 Difference]: With dead ends: 2029 [2018-11-10 10:29:51,563 INFO L226 Difference]: Without dead ends: 1113 [2018-11-10 10:29:51,564 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 10:29:51,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2018-11-10 10:29:51,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 942. [2018-11-10 10:29:51,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2018-11-10 10:29:51,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1497 transitions. [2018-11-10 10:29:51,582 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1497 transitions. Word has length 125 [2018-11-10 10:29:51,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:51,582 INFO L481 AbstractCegarLoop]: Abstraction has 942 states and 1497 transitions. [2018-11-10 10:29:51,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:51,582 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1497 transitions. [2018-11-10 10:29:51,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:29:51,584 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:51,584 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, 1, 1] [2018-11-10 10:29:51,584 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:51,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:51,585 INFO L82 PathProgramCache]: Analyzing trace with hash -24059285, now seen corresponding path program 1 times [2018-11-10 10:29:51,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:51,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:51,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:51,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:51,586 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:51,654 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 10:29:51,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:51,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:51,655 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:51,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:51,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:51,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:51,655 INFO L87 Difference]: Start difference. First operand 942 states and 1497 transitions. Second operand 4 states. [2018-11-10 10:29:51,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:51,913 INFO L93 Difference]: Finished difference Result 2115 states and 3328 transitions. [2018-11-10 10:29:51,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:51,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-11-10 10:29:51,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:51,917 INFO L225 Difference]: With dead ends: 2115 [2018-11-10 10:29:51,917 INFO L226 Difference]: Without dead ends: 1199 [2018-11-10 10:29:51,918 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 10:29:51,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2018-11-10 10:29:51,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1000. [2018-11-10 10:29:51,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2018-11-10 10:29:51,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1579 transitions. [2018-11-10 10:29:51,935 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1579 transitions. Word has length 128 [2018-11-10 10:29:51,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:51,936 INFO L481 AbstractCegarLoop]: Abstraction has 1000 states and 1579 transitions. [2018-11-10 10:29:51,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:51,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1579 transitions. [2018-11-10 10:29:51,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-10 10:29:51,937 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:51,937 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, 1, 1] [2018-11-10 10:29:51,938 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:51,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:51,938 INFO L82 PathProgramCache]: Analyzing trace with hash 769461103, now seen corresponding path program 1 times [2018-11-10 10:29:51,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:51,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:51,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:51,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:51,939 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:51,996 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 10:29:51,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:51,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:51,997 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:51,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:51,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:51,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:51,997 INFO L87 Difference]: Start difference. First operand 1000 states and 1579 transitions. Second operand 4 states. [2018-11-10 10:29:52,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:52,247 INFO L93 Difference]: Finished difference Result 2145 states and 3354 transitions. [2018-11-10 10:29:52,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:52,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2018-11-10 10:29:52,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:52,249 INFO L225 Difference]: With dead ends: 2145 [2018-11-10 10:29:52,249 INFO L226 Difference]: Without dead ends: 1171 [2018-11-10 10:29:52,250 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 10:29:52,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2018-11-10 10:29:52,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1000. [2018-11-10 10:29:52,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2018-11-10 10:29:52,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1563 transitions. [2018-11-10 10:29:52,269 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1563 transitions. Word has length 129 [2018-11-10 10:29:52,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:52,269 INFO L481 AbstractCegarLoop]: Abstraction has 1000 states and 1563 transitions. [2018-11-10 10:29:52,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:52,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1563 transitions. [2018-11-10 10:29:52,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-10 10:29:52,271 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:52,271 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, 1, 1] [2018-11-10 10:29:52,271 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:52,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:52,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1344555660, now seen corresponding path program 1 times [2018-11-10 10:29:52,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:52,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:52,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:52,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:52,272 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:52,322 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 10:29:52,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:52,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:52,322 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:52,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:52,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:52,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:52,323 INFO L87 Difference]: Start difference. First operand 1000 states and 1563 transitions. Second operand 4 states. [2018-11-10 10:29:52,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:52,606 INFO L93 Difference]: Finished difference Result 2231 states and 3456 transitions. [2018-11-10 10:29:52,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:52,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2018-11-10 10:29:52,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:52,608 INFO L225 Difference]: With dead ends: 2231 [2018-11-10 10:29:52,609 INFO L226 Difference]: Without dead ends: 1257 [2018-11-10 10:29:52,610 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 10:29:52,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2018-11-10 10:29:52,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1072. [2018-11-10 10:29:52,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2018-11-10 10:29:52,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1671 transitions. [2018-11-10 10:29:52,629 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1671 transitions. Word has length 136 [2018-11-10 10:29:52,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:52,629 INFO L481 AbstractCegarLoop]: Abstraction has 1072 states and 1671 transitions. [2018-11-10 10:29:52,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:52,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1671 transitions. [2018-11-10 10:29:52,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-10 10:29:52,631 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:52,631 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, 1, 1] [2018-11-10 10:29:52,631 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:52,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:52,631 INFO L82 PathProgramCache]: Analyzing trace with hash -806432843, now seen corresponding path program 1 times [2018-11-10 10:29:52,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:52,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:52,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:52,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:52,632 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:52,687 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 10:29:52,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:52,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:52,687 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:52,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:52,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:52,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:52,688 INFO L87 Difference]: Start difference. First operand 1072 states and 1671 transitions. Second operand 4 states. [2018-11-10 10:29:53,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:53,110 INFO L93 Difference]: Finished difference Result 2289 states and 3538 transitions. [2018-11-10 10:29:53,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:53,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2018-11-10 10:29:53,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:53,114 INFO L225 Difference]: With dead ends: 2289 [2018-11-10 10:29:53,114 INFO L226 Difference]: Without dead ends: 1243 [2018-11-10 10:29:53,117 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 10:29:53,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2018-11-10 10:29:53,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1072. [2018-11-10 10:29:53,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2018-11-10 10:29:53,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1663 transitions. [2018-11-10 10:29:53,163 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1663 transitions. Word has length 137 [2018-11-10 10:29:53,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:53,164 INFO L481 AbstractCegarLoop]: Abstraction has 1072 states and 1663 transitions. [2018-11-10 10:29:53,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:53,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1663 transitions. [2018-11-10 10:29:53,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-10 10:29:53,166 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:53,166 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 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 10:29:53,167 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:53,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:53,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1732337042, now seen corresponding path program 1 times [2018-11-10 10:29:53,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:53,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:53,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:53,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:53,168 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:53,257 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 10:29:53,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:53,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:53,257 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:53,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:53,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:53,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:53,258 INFO L87 Difference]: Start difference. First operand 1072 states and 1663 transitions. Second operand 4 states. [2018-11-10 10:29:53,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:53,423 INFO L93 Difference]: Finished difference Result 1639 states and 2551 transitions. [2018-11-10 10:29:53,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:53,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-11-10 10:29:53,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:53,425 INFO L225 Difference]: With dead ends: 1639 [2018-11-10 10:29:53,425 INFO L226 Difference]: Without dead ends: 1113 [2018-11-10 10:29:53,426 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 10:29:53,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2018-11-10 10:29:53,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1095. [2018-11-10 10:29:53,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2018-11-10 10:29:53,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1699 transitions. [2018-11-10 10:29:53,457 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1699 transitions. Word has length 155 [2018-11-10 10:29:53,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:53,457 INFO L481 AbstractCegarLoop]: Abstraction has 1095 states and 1699 transitions. [2018-11-10 10:29:53,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:53,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1699 transitions. [2018-11-10 10:29:53,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-10 10:29:53,459 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:53,459 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, 1, 1] [2018-11-10 10:29:53,459 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:53,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:53,459 INFO L82 PathProgramCache]: Analyzing trace with hash -118179921, now seen corresponding path program 1 times [2018-11-10 10:29:53,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:53,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:53,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:53,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:53,461 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:53,536 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 10:29:53,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:53,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:53,537 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:53,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:53,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:53,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:53,537 INFO L87 Difference]: Start difference. First operand 1095 states and 1699 transitions. Second operand 4 states. [2018-11-10 10:29:53,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:53,941 INFO L93 Difference]: Finished difference Result 2421 states and 3724 transitions. [2018-11-10 10:29:53,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:53,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-11-10 10:29:53,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:53,943 INFO L225 Difference]: With dead ends: 2421 [2018-11-10 10:29:53,943 INFO L226 Difference]: Without dead ends: 1352 [2018-11-10 10:29:53,944 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 10:29:53,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2018-11-10 10:29:53,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1149. [2018-11-10 10:29:53,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1149 states. [2018-11-10 10:29:53,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1769 transitions. [2018-11-10 10:29:53,975 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1769 transitions. Word has length 157 [2018-11-10 10:29:53,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:53,975 INFO L481 AbstractCegarLoop]: Abstraction has 1149 states and 1769 transitions. [2018-11-10 10:29:53,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:53,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1769 transitions. [2018-11-10 10:29:53,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-10 10:29:53,977 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:53,977 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, 1, 1] [2018-11-10 10:29:53,978 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:53,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:53,978 INFO L82 PathProgramCache]: Analyzing trace with hash 531844235, now seen corresponding path program 1 times [2018-11-10 10:29:53,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:53,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:53,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:53,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:53,979 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:54,067 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 10:29:54,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:54,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:54,068 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:54,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:54,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:54,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:54,068 INFO L87 Difference]: Start difference. First operand 1149 states and 1769 transitions. Second operand 4 states. [2018-11-10 10:29:54,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:54,318 INFO L93 Difference]: Finished difference Result 2443 states and 3734 transitions. [2018-11-10 10:29:54,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:54,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-11-10 10:29:54,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:54,320 INFO L225 Difference]: With dead ends: 2443 [2018-11-10 10:29:54,320 INFO L226 Difference]: Without dead ends: 1320 [2018-11-10 10:29:54,321 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 10:29:54,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2018-11-10 10:29:54,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1149. [2018-11-10 10:29:54,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1149 states. [2018-11-10 10:29:54,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1749 transitions. [2018-11-10 10:29:54,354 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1749 transitions. Word has length 158 [2018-11-10 10:29:54,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:54,355 INFO L481 AbstractCegarLoop]: Abstraction has 1149 states and 1749 transitions. [2018-11-10 10:29:54,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:54,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1749 transitions. [2018-11-10 10:29:54,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-10 10:29:54,356 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:54,356 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, 1, 1, 1, 1, 1, 1] [2018-11-10 10:29:54,357 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:54,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:54,357 INFO L82 PathProgramCache]: Analyzing trace with hash 937831995, now seen corresponding path program 1 times [2018-11-10 10:29:54,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:54,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:54,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:54,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:54,358 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:54,416 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 10:29:54,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:54,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:54,417 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:54,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:54,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:54,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:54,417 INFO L87 Difference]: Start difference. First operand 1149 states and 1749 transitions. Second operand 4 states. [2018-11-10 10:29:54,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:54,689 INFO L93 Difference]: Finished difference Result 2532 states and 3823 transitions. [2018-11-10 10:29:54,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:54,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-11-10 10:29:54,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:54,692 INFO L225 Difference]: With dead ends: 2532 [2018-11-10 10:29:54,692 INFO L226 Difference]: Without dead ends: 1409 [2018-11-10 10:29:54,692 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 10:29:54,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2018-11-10 10:29:54,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1236. [2018-11-10 10:29:54,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1236 states. [2018-11-10 10:29:54,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1872 transitions. [2018-11-10 10:29:54,715 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1872 transitions. Word has length 158 [2018-11-10 10:29:54,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:54,715 INFO L481 AbstractCegarLoop]: Abstraction has 1236 states and 1872 transitions. [2018-11-10 10:29:54,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:54,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1872 transitions. [2018-11-10 10:29:54,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-10 10:29:54,717 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:54,717 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, 1, 1, 1, 1, 1, 1] [2018-11-10 10:29:54,717 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:54,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:54,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1196226428, now seen corresponding path program 1 times [2018-11-10 10:29:54,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:54,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:54,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:54,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:54,718 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:54,773 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 10:29:54,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:54,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:54,773 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:54,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:54,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:54,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:54,774 INFO L87 Difference]: Start difference. First operand 1236 states and 1872 transitions. Second operand 4 states. [2018-11-10 10:29:55,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:55,031 INFO L93 Difference]: Finished difference Result 2617 states and 3940 transitions. [2018-11-10 10:29:55,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:55,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-11-10 10:29:55,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:55,034 INFO L225 Difference]: With dead ends: 2617 [2018-11-10 10:29:55,034 INFO L226 Difference]: Without dead ends: 1391 [2018-11-10 10:29:55,035 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 10:29:55,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2018-11-10 10:29:55,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1220. [2018-11-10 10:29:55,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1220 states. [2018-11-10 10:29:55,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1844 transitions. [2018-11-10 10:29:55,059 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1844 transitions. Word has length 159 [2018-11-10 10:29:55,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:55,059 INFO L481 AbstractCegarLoop]: Abstraction has 1220 states and 1844 transitions. [2018-11-10 10:29:55,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:55,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1844 transitions. [2018-11-10 10:29:55,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-10 10:29:55,060 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:55,060 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, 1, 1] [2018-11-10 10:29:55,061 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:55,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:55,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1020155880, now seen corresponding path program 1 times [2018-11-10 10:29:55,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:55,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:55,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:55,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:55,062 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:55,155 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 10:29:55,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:55,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:55,155 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:55,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:55,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:55,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:55,156 INFO L87 Difference]: Start difference. First operand 1220 states and 1844 transitions. Second operand 4 states. [2018-11-10 10:29:55,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:55,614 INFO L93 Difference]: Finished difference Result 2655 states and 3992 transitions. [2018-11-10 10:29:55,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:55,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2018-11-10 10:29:55,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:55,618 INFO L225 Difference]: With dead ends: 2655 [2018-11-10 10:29:55,618 INFO L226 Difference]: Without dead ends: 1461 [2018-11-10 10:29:55,619 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 10:29:55,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2018-11-10 10:29:55,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1288. [2018-11-10 10:29:55,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2018-11-10 10:29:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1938 transitions. [2018-11-10 10:29:55,661 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1938 transitions. Word has length 171 [2018-11-10 10:29:55,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:55,661 INFO L481 AbstractCegarLoop]: Abstraction has 1288 states and 1938 transitions. [2018-11-10 10:29:55,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:55,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1938 transitions. [2018-11-10 10:29:55,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-10 10:29:55,663 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:55,666 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, 1, 1] [2018-11-10 10:29:55,666 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:55,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:55,666 INFO L82 PathProgramCache]: Analyzing trace with hash -2124923201, now seen corresponding path program 1 times [2018-11-10 10:29:55,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:55,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:55,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:55,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:55,667 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:55,755 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 10:29:55,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:55,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:55,755 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:55,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:55,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:55,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:55,757 INFO L87 Difference]: Start difference. First operand 1288 states and 1938 transitions. Second operand 4 states. [2018-11-10 10:29:56,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:56,294 INFO L93 Difference]: Finished difference Result 2721 states and 4072 transitions. [2018-11-10 10:29:56,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:56,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2018-11-10 10:29:56,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:56,297 INFO L225 Difference]: With dead ends: 2721 [2018-11-10 10:29:56,297 INFO L226 Difference]: Without dead ends: 1441 [2018-11-10 10:29:56,298 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 10:29:56,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2018-11-10 10:29:56,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1204. [2018-11-10 10:29:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2018-11-10 10:29:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1798 transitions. [2018-11-10 10:29:56,330 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1798 transitions. Word has length 172 [2018-11-10 10:29:56,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:56,330 INFO L481 AbstractCegarLoop]: Abstraction has 1204 states and 1798 transitions. [2018-11-10 10:29:56,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:56,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1798 transitions. [2018-11-10 10:29:56,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 10:29:56,332 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:56,332 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 10:29:56,332 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:56,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:56,332 INFO L82 PathProgramCache]: Analyzing trace with hash 320424237, now seen corresponding path program 1 times [2018-11-10 10:29:56,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:56,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:56,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:56,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:56,333 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:56,432 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 10:29:56,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:56,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:29:56,432 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:56,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:29:56,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:29:56,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:29:56,433 INFO L87 Difference]: Start difference. First operand 1204 states and 1798 transitions. Second operand 3 states. [2018-11-10 10:29:56,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:56,516 INFO L93 Difference]: Finished difference Result 2408 states and 3621 transitions. [2018-11-10 10:29:56,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:29:56,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2018-11-10 10:29:56,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:56,519 INFO L225 Difference]: With dead ends: 2408 [2018-11-10 10:29:56,519 INFO L226 Difference]: Without dead ends: 1804 [2018-11-10 10:29:56,520 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 10:29:56,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2018-11-10 10:29:56,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1783. [2018-11-10 10:29:56,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1783 states. [2018-11-10 10:29:56,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2669 transitions. [2018-11-10 10:29:56,558 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2669 transitions. Word has length 178 [2018-11-10 10:29:56,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:56,558 INFO L481 AbstractCegarLoop]: Abstraction has 1783 states and 2669 transitions. [2018-11-10 10:29:56,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:29:56,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2669 transitions. [2018-11-10 10:29:56,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 10:29:56,560 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:56,560 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, 1, 1] [2018-11-10 10:29:56,560 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:56,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:56,561 INFO L82 PathProgramCache]: Analyzing trace with hash 296110402, now seen corresponding path program 1 times [2018-11-10 10:29:56,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:56,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:56,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:56,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:56,563 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:56,611 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 10:29:56,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:56,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:56,611 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:56,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:56,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:56,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:56,612 INFO L87 Difference]: Start difference. First operand 1783 states and 2669 transitions. Second operand 4 states. [2018-11-10 10:29:56,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:56,927 INFO L93 Difference]: Finished difference Result 3868 states and 5761 transitions. [2018-11-10 10:29:56,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:56,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-11-10 10:29:56,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:56,931 INFO L225 Difference]: With dead ends: 3868 [2018-11-10 10:29:56,931 INFO L226 Difference]: Without dead ends: 2111 [2018-11-10 10:29:56,932 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 10:29:56,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2018-11-10 10:29:56,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 1858. [2018-11-10 10:29:56,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1858 states. [2018-11-10 10:29:56,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2756 transitions. [2018-11-10 10:29:56,975 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2756 transitions. Word has length 180 [2018-11-10 10:29:56,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:56,975 INFO L481 AbstractCegarLoop]: Abstraction has 1858 states and 2756 transitions. [2018-11-10 10:29:56,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:56,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2756 transitions. [2018-11-10 10:29:56,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-10 10:29:56,977 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:56,977 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, 1, 1, 1, 1, 1, 1] [2018-11-10 10:29:56,977 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:56,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:56,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1181693764, now seen corresponding path program 1 times [2018-11-10 10:29:56,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:56,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:56,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:56,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:56,978 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:57,058 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 10:29:57,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:57,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:57,060 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:57,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:57,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:57,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:57,062 INFO L87 Difference]: Start difference. First operand 1858 states and 2756 transitions. Second operand 4 states. [2018-11-10 10:29:57,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:57,483 INFO L93 Difference]: Finished difference Result 3940 states and 5809 transitions. [2018-11-10 10:29:57,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:57,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2018-11-10 10:29:57,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:57,486 INFO L225 Difference]: With dead ends: 3940 [2018-11-10 10:29:57,486 INFO L226 Difference]: Without dead ends: 2108 [2018-11-10 10:29:57,489 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 10:29:57,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2018-11-10 10:29:57,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 1858. [2018-11-10 10:29:57,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1858 states. [2018-11-10 10:29:57,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2717 transitions. [2018-11-10 10:29:57,557 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2717 transitions. Word has length 181 [2018-11-10 10:29:57,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:57,558 INFO L481 AbstractCegarLoop]: Abstraction has 1858 states and 2717 transitions. [2018-11-10 10:29:57,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:57,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2717 transitions. [2018-11-10 10:29:57,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-10 10:29:57,560 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:57,560 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, 1, 1] [2018-11-10 10:29:57,560 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:57,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:57,560 INFO L82 PathProgramCache]: Analyzing trace with hash -844719738, now seen corresponding path program 1 times [2018-11-10 10:29:57,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:57,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:57,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:57,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:57,561 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:57,680 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 10:29:57,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:57,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:57,681 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:57,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:57,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:57,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:57,681 INFO L87 Difference]: Start difference. First operand 1858 states and 2717 transitions. Second operand 4 states. [2018-11-10 10:29:58,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:58,087 INFO L93 Difference]: Finished difference Result 3940 states and 5731 transitions. [2018-11-10 10:29:58,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:58,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2018-11-10 10:29:58,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:58,090 INFO L225 Difference]: With dead ends: 3940 [2018-11-10 10:29:58,090 INFO L226 Difference]: Without dead ends: 2102 [2018-11-10 10:29:58,093 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 10:29:58,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states. [2018-11-10 10:29:58,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 1850. [2018-11-10 10:29:58,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1850 states. [2018-11-10 10:29:58,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 2670 transitions. [2018-11-10 10:29:58,164 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 2670 transitions. Word has length 181 [2018-11-10 10:29:58,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:58,165 INFO L481 AbstractCegarLoop]: Abstraction has 1850 states and 2670 transitions. [2018-11-10 10:29:58,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:58,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2670 transitions. [2018-11-10 10:29:58,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-10 10:29:58,166 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:58,167 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, 1, 1, 1, 1, 1, 1] [2018-11-10 10:29:58,167 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:58,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:58,167 INFO L82 PathProgramCache]: Analyzing trace with hash 830414936, now seen corresponding path program 1 times [2018-11-10 10:29:58,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:58,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:58,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:58,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:58,168 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:58,258 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 10:29:58,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:58,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:29:58,258 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:29:58,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:29:58,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:29:58,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:29:58,259 INFO L87 Difference]: Start difference. First operand 1850 states and 2670 transitions. Second operand 4 states. [2018-11-10 10:29:58,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:58,547 INFO L93 Difference]: Finished difference Result 3307 states and 4762 transitions. [2018-11-10 10:29:58,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:29:58,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2018-11-10 10:29:58,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:29:58,550 INFO L225 Difference]: With dead ends: 3307 [2018-11-10 10:29:58,550 INFO L226 Difference]: Without dead ends: 1477 [2018-11-10 10:29:58,552 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 10:29:58,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2018-11-10 10:29:58,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1305. [2018-11-10 10:29:58,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1305 states. [2018-11-10 10:29:58,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1859 transitions. [2018-11-10 10:29:58,597 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 1859 transitions. Word has length 182 [2018-11-10 10:29:58,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:29:58,597 INFO L481 AbstractCegarLoop]: Abstraction has 1305 states and 1859 transitions. [2018-11-10 10:29:58,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:29:58,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1859 transitions. [2018-11-10 10:29:58,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-10 10:29:58,598 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:29:58,599 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, 1, 1, 1, 1, 1, 1] [2018-11-10 10:29:58,599 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:29:58,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:58,599 INFO L82 PathProgramCache]: Analyzing trace with hash 72233480, now seen corresponding path program 1 times [2018-11-10 10:29:58,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:29:58,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:58,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:58,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:58,600 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:29:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:58,869 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 10:29:58,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:29:58,869 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:29:58,870 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2018-11-10 10:29:58,871 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], [530], [535], [550], [555], [560], [565], [570], [575], [581], [586], [588], [593], [598], [603], [608], [614], [617], [621], [642], [676], [678], [690], [693], [694], [695], [697] [2018-11-10 10:29:58,916 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 10:29:58,916 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 10:29:59,443 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 10:30:35,361 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 10:30:35,362 INFO L272 AbstractInterpreter]: Visited 86 different actions 444 times. Merged at 72 different actions 343 times. Widened at 9 different actions 9 times. Found 18 fixpoints after 8 different actions. Largest state had 142 variables. [2018-11-10 10:30:35,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:35,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 10:30:35,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:30:35,376 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:30:35,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:35,382 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 10:30:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:35,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:30:35,665 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 10:30:35,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:35,683 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 10:30:35,685 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 10:30:35,686 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:35,689 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:30:35,698 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 10:30:35,701 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 10:30:35,703 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:30:35,704 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 10:30:35,712 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:30:35,715 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:30:35,716 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:30:35,720 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 10:30:35,721 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:35,727 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:30:35,732 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:30:35,736 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:30:35,744 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 10:30:35,745 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:51, output treesize:23 [2018-11-10 10:30:35,794 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 10:30:35,796 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 10:30:35,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:35,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:30:35,819 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 10:30:35,821 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 10:30:35,822 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:35,834 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:30:35,839 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 10:30:35,839 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:45, output treesize:14 [2018-11-10 10:30:35,858 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 10:30:35,860 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 10:30:35,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:35,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:30:35,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:30:35,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-10 10:30:35,885 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 10:30:35,887 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 10:30:35,888 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 10:30:35,891 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 10:30:35,900 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 10:30:35,902 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 10:30:35,903 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:35,912 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:30:35,917 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 10:30:35,917 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:13 [2018-11-10 10:30:35,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 21 treesize of output 16 [2018-11-10 10:30:35,936 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:30:35,937 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 10:30:35,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:35,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:30:35,946 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 10:30:35,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:13 [2018-11-10 10:30:35,950 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 10:30:35,951 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 10:30:35,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:35,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:30:35,955 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 10:30:35,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-10 10:30:36,030 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 10:30:36,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:30:36,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-11-10 10:30:36,135 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 10:30:36,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:36,142 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 10:30:36,148 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 10:30:36,148 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:36,151 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:30:36,157 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 10:30:36,174 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 10:30:36,174 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:10 [2018-11-10 10:30:36,448 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 10:30:36,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:30:36,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2018-11-10 10:30:36,466 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:30:36,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 10:30:36,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 10:30:36,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-11-10 10:30:36,467 INFO L87 Difference]: Start difference. First operand 1305 states and 1859 transitions. Second operand 16 states. [2018-11-10 10:30:37,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:37,795 INFO L93 Difference]: Finished difference Result 2581 states and 3675 transitions. [2018-11-10 10:30:37,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:30:37,796 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 184 [2018-11-10 10:30:37,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:30:37,800 INFO L225 Difference]: With dead ends: 2581 [2018-11-10 10:30:37,800 INFO L226 Difference]: Without dead ends: 1337 [2018-11-10 10:30:37,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 358 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2018-11-10 10:30:37,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2018-11-10 10:30:37,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1169. [2018-11-10 10:30:37,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1169 states. [2018-11-10 10:30:37,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1667 transitions. [2018-11-10 10:30:37,865 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1667 transitions. Word has length 184 [2018-11-10 10:30:37,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:30:37,866 INFO L481 AbstractCegarLoop]: Abstraction has 1169 states and 1667 transitions. [2018-11-10 10:30:37,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 10:30:37,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1667 transitions. [2018-11-10 10:30:37,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-10 10:30:37,868 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:30:37,868 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, 1] [2018-11-10 10:30:37,869 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:30:37,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:37,869 INFO L82 PathProgramCache]: Analyzing trace with hash 857697873, now seen corresponding path program 1 times [2018-11-10 10:30:37,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:30:37,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:37,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:30:37,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:37,870 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:30:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:38,268 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 10:30:38,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:30:38,268 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:30:38,268 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 207 with the following transitions: [2018-11-10 10:30:38,269 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], [530], [535], [642], [676], [678], [690], [693], [694], [695], [697] [2018-11-10 10:30:38,273 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 10:30:38,273 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 10:30:38,667 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 10:31:33,387 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 10:31:33,387 INFO L272 AbstractInterpreter]: Visited 88 different actions 626 times. Merged at 74 different actions 497 times. Widened at 13 different actions 37 times. Found 46 fixpoints after 20 different actions. Largest state had 153 variables. [2018-11-10 10:31:33,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:33,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 10:31:33,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:31:33,388 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:31:33,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:33,395 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 10:31:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:33,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:33,604 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 10:31:33,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:33,611 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 10:31:33,615 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 10:31:33,618 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:33,619 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 10:31:33,621 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:33,622 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:33,628 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 10:31:33,629 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-10 10:31:33,642 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:31:33,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:31:33,657 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:31:33,673 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 10:31:33,674 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:35, output treesize:10 [2018-11-10 10:31:33,711 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 10:31:33,714 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 10:31:33,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:33,723 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 10:31:33,725 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 10:31:33,726 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:33,736 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 10:31:33,745 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 10:31:33,746 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 10:31:33,755 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:31:33,767 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 10:31:33,780 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 10:31:33,807 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 10:31:33,808 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:118, output treesize:74 [2018-11-10 10:31:33,839 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 10:31:33,840 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 10:31:33,841 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 10:31:33,845 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 10:31:33,851 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 10:31:33,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 22 treesize of output 21 [2018-11-10 10:31:33,852 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:33,854 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:33,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, 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 10:31:33,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 21 treesize of output 9 [2018-11-10 10:31:33,861 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:33,864 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:33,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:33,869 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:63, output treesize:20 [2018-11-10 10:31:33,883 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 10:31:33,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2018-11-10 10:31:33,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:33,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:33,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:33,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:9 [2018-11-10 10:31:33,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 10:31:33,909 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 10:31:33,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:33,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:33,912 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 10:31:33,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:31:33,974 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 10:31:33,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:31:33,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 119 [2018-11-10 10:31:34,001 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 10:31:34,002 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 10:31:34,004 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 10:31:34,007 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 10:31:34,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 11 treesize of output 10 [2018-11-10 10:31:34,009 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:34,019 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:34,021 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 10:31:34,041 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:31:34,048 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 10:31:34,048 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 10:31:34,062 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 10:31:34,063 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:31:34,064 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:31:34,064 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 10:31:34,065 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:34,067 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:34,069 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 10:31:34,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 8 treesize of output 1 [2018-11-10 10:31:34,071 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:34,072 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:34,078 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 10:31:34,082 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 10:31:34,085 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 10:31:34,085 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:125, output treesize:10 [2018-11-10 10:31:34,151 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 10:31:34,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:31:34,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 18 [2018-11-10 10:31:34,169 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:31:34,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 10:31:34,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 10:31:34,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-11-10 10:31:34,170 INFO L87 Difference]: Start difference. First operand 1169 states and 1667 transitions. Second operand 17 states. [2018-11-10 10:31:36,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:31:36,351 INFO L93 Difference]: Finished difference Result 6400 states and 9168 transitions. [2018-11-10 10:31:36,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 10:31:36,351 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 206 [2018-11-10 10:31:36,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:31:36,359 INFO L225 Difference]: With dead ends: 6400 [2018-11-10 10:31:36,359 INFO L226 Difference]: Without dead ends: 5292 [2018-11-10 10:31:36,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2018-11-10 10:31:36,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5292 states. [2018-11-10 10:31:36,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5292 to 2248. [2018-11-10 10:31:36,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2018-11-10 10:31:36,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 3275 transitions. [2018-11-10 10:31:36,497 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 3275 transitions. Word has length 206 [2018-11-10 10:31:36,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:31:36,498 INFO L481 AbstractCegarLoop]: Abstraction has 2248 states and 3275 transitions. [2018-11-10 10:31:36,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 10:31:36,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 3275 transitions. [2018-11-10 10:31:36,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-10 10:31:36,500 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:36,500 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, 1, 1, 1, 1, 1, 1] [2018-11-10 10:31:36,500 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:31:36,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:36,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1430859666, now seen corresponding path program 1 times [2018-11-10 10:31:36,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:31:36,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:31:36,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:36,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:31:36,502 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:31:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:31:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:31:36,795 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 10:31:36,814 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:31:36,815 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:31:36,815 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:31:36,816 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:31:36,816 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:31:36,816 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:31:36,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:31:36 BoogieIcfgContainer [2018-11-10 10:31:36,876 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 10:31:36,877 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:31:36,877 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:31:36,877 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:31:36,877 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:29:44" (3/4) ... [2018-11-10 10:31:36,882 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 10:31:36,882 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:31:36,883 INFO L168 Benchmark]: Toolchain (without parser) took 114603.57 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 955.4 MB in the beginning and 1.3 GB in the end (delta: -382.5 MB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. [2018-11-10 10:31:36,884 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:31:36,884 INFO L168 Benchmark]: CACSL2BoogieTranslator took 736.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 955.4 MB in the beginning and 1.0 GB in the end (delta: -90.6 MB). Peak memory consumption was 101.0 MB. Max. memory is 11.5 GB. [2018-11-10 10:31:36,884 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2018-11-10 10:31:36,884 INFO L168 Benchmark]: Boogie Preprocessor took 72.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2018-11-10 10:31:36,885 INFO L168 Benchmark]: RCFGBuilder took 1009.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -85.1 MB). Peak memory consumption was 175.3 MB. Max. memory is 11.5 GB. [2018-11-10 10:31:36,885 INFO L168 Benchmark]: TraceAbstraction took 112706.91 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -225.2 MB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2018-11-10 10:31:36,885 INFO L168 Benchmark]: Witness Printer took 5.38 ms. Allocated memory is still 5.0 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:31:36,890 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 736.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 955.4 MB in the beginning and 1.0 GB in the end (delta: -90.6 MB). Peak memory consumption was 101.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 72.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1009.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -85.1 MB). Peak memory consumption was 175.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 112706.91 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -225.2 MB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. * Witness Printer took 5.38 ms. Allocated memory is still 5.0 GB. Free memory is still 1.3 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: 1774]: 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={24585: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={24585: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={24585: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={24585: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 [L1733] CALL, EXPR s->s3 [L1733] RET, EXPR s->s3 [L1733] CALL, EXPR (s->s3)->tmp.reuse_message [L1733] RET, EXPR (s->s3)->tmp.reuse_message [L1733] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1762] skip = 0 VAL [init=1, SSLv3_server_data={24585:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24585: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={24585: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 [L1733] CALL, EXPR s->s3 [L1733] RET, EXPR s->s3 [L1733] CALL, EXPR (s->s3)->tmp.reuse_message [L1733] RET, EXPR (s->s3)->tmp.reuse_message [L1733] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1762] skip = 0 VAL [init=1, SSLv3_server_data={24585:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24585: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 [L1602] CALL, EXPR s->session [L1602] RET, EXPR s->session [L1602] CALL, EXPR s->s3 [L1602] RET, EXPR s->s3 [L1602] CALL, EXPR (s->s3)->tmp.new_cipher [L1602] RET, EXPR (s->s3)->tmp.new_cipher [L1602] CALL (s->session)->cipher = (s->s3)->tmp.new_cipher [L1602] RET (s->session)->cipher = (s->s3)->tmp.new_cipher [L1603] COND FALSE !(! tmp___9) [L1609] ret = __VERIFIER_nondet_int() [L1610] COND FALSE !(blastFlag == 10) VAL [init=1, SSLv3_server_data={24585:0}] [L1613] COND FALSE !(blastFlag == 13) VAL [init=1, SSLv3_server_data={24585:0}] [L1616] COND FALSE !(blastFlag == 16) VAL [init=1, SSLv3_server_data={24585:0}] [L1619] COND FALSE !(blastFlag == 19) VAL [init=1, SSLv3_server_data={24585:0}] [L1627] COND FALSE !(ret <= 0) [L1632] CALL s->state = 8672 [L1632] RET s->state = 8672 [L1633] CALL s->init_num = 0 [L1633] RET s->init_num = 0 [L1634] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={24585:0}] [L1733] CALL, EXPR s->s3 [L1733] RET, EXPR s->s3 [L1733] CALL, EXPR (s->s3)->tmp.reuse_message [L1733] RET, EXPR (s->s3)->tmp.reuse_message [L1733] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1762] skip = 0 VAL [init=1, SSLv3_server_data={24585:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24585: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 [L1643] ret = __VERIFIER_nondet_int() [L1644] COND FALSE !(blastFlag == 11) VAL [init=1, SSLv3_server_data={24585:0}] [L1647] COND FALSE !(blastFlag == 14) VAL [init=1, SSLv3_server_data={24585:0}] [L1650] COND FALSE !(blastFlag == 17) VAL [init=1, SSLv3_server_data={24585:0}] [L1653] COND FALSE !(blastFlag == 20) VAL [init=1, SSLv3_server_data={24585:0}] [L1661] COND FALSE !(ret <= 0) [L1666] CALL s->state = 8448 [L1666] RET s->state = 8448 [L1667] CALL s->hit [L1667] RET s->hit [L1667] COND TRUE s->hit [L1668] CALL, EXPR s->s3 [L1668] RET, EXPR s->s3 [L1668] CALL (s->s3)->tmp.next_state = 8640 [L1668] RET (s->s3)->tmp.next_state = 8640 [L1672] CALL s->init_num = 0 [L1672] RET s->init_num = 0 [L1733] CALL, EXPR s->s3 [L1733] RET, EXPR s->s3 [L1733] CALL, EXPR (s->s3)->tmp.reuse_message [L1733] RET, EXPR (s->s3)->tmp.reuse_message [L1733] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1762] skip = 0 VAL [init=1, SSLv3_server_data={24585:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24585: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={24585: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 [L1733] CALL, EXPR s->s3 [L1733] RET, EXPR s->s3 [L1733] CALL, EXPR (s->s3)->tmp.reuse_message [L1733] RET, EXPR (s->s3)->tmp.reuse_message [L1733] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1762] skip = 0 VAL [init=1, SSLv3_server_data={24585:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24585: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={24585:0}] [L1574] COND FALSE !(blastFlag == 12) VAL [init=1, SSLv3_server_data={24585:0}] [L1577] COND FALSE !(blastFlag == 15) VAL [init=1, SSLv3_server_data={24585:0}] [L1580] COND FALSE !(blastFlag == 18) VAL [init=1, SSLv3_server_data={24585:0}] [L1774] __VERIFIER_error() VAL [init=1, SSLv3_server_data={24585:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 1 error locations. UNSAFE Result, 112.6s OverallTime, 37 OverallIterations, 7 TraceHistogramMax, 14.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6214 SDtfs, 7547 SDslu, 13633 SDs, 0 SdLazy, 11465 SolverSat, 1839 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 993 GetRequests, 842 SyntacticMatches, 3 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2248occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 91.6s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 36 MinimizatonAttempts, 7916 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 5316 NumberOfCodeBlocks, 5316 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 5452 ConstructedInterpolants, 84 QuantifiedInterpolants, 4804376 SizeOfPredicates, 107 NumberOfNonLiveVariables, 4103 ConjunctsInSsa, 170 ConjunctsInUnsatCore, 40 InterpolantComputations, 34 PerfectInterpolantSequences, 4653/5604 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 10:31:38,430 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:31:38,431 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:31:38,440 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:31:38,440 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:31:38,440 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:31:38,441 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:31:38,442 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:31:38,443 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:31:38,444 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:31:38,444 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:31:38,444 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:31:38,445 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:31:38,446 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:31:38,446 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:31:38,447 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:31:38,447 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:31:38,449 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:31:38,450 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:31:38,451 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:31:38,451 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:31:38,452 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:31:38,454 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:31:38,454 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:31:38,454 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:31:38,455 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:31:38,455 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:31:38,456 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:31:38,456 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:31:38,457 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:31:38,457 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:31:38,458 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:31:38,458 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:31:38,458 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:31:38,458 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:31:38,459 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:31:38,459 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-10 10:31:38,469 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:31:38,469 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:31:38,470 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:31:38,470 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 10:31:38,470 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 10:31:38,470 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 10:31:38,470 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 10:31:38,470 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 10:31:38,471 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:31:38,471 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:31:38,471 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:31:38,471 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:31:38,471 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 10:31:38,471 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:31:38,472 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 10:31:38,472 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 10:31:38,472 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 10:31:38,472 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:31:38,472 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:31:38,472 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 10:31:38,472 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:31:38,473 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:31:38,473 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:31:38,473 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 10:31:38,473 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:31:38,473 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:31:38,473 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:31:38,473 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 10:31:38,474 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-10 10:31:38,474 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:31:38,474 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 10:31:38,474 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 10:31:38,474 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_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 -> 12b9509fef02d71cc2f0a70f9270a898a3e1b6a5 [2018-11-10 10:31:38,503 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:31:38,513 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:31:38,515 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:31:38,517 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:31:38,517 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:31:38,518 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.06_false-unreach-call.i.cil.c [2018-11-10 10:31:38,557 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/bin-2019/utaipan/data/55f363acf/c09b742bb4324e3792f7eb1948773d5f/FLAGfd0259959 [2018-11-10 10:31:38,943 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:31:38,944 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/sv-benchmarks/c/ssh/s3_srvr.blast.06_false-unreach-call.i.cil.c [2018-11-10 10:31:38,955 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/bin-2019/utaipan/data/55f363acf/c09b742bb4324e3792f7eb1948773d5f/FLAGfd0259959 [2018-11-10 10:31:38,964 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/bin-2019/utaipan/data/55f363acf/c09b742bb4324e3792f7eb1948773d5f [2018-11-10 10:31:38,966 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:31:38,967 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:31:38,968 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:31:38,968 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:31:38,970 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:31:38,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:31:38" (1/1) ... [2018-11-10 10:31:38,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fd1dd72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:38, skipping insertion in model container [2018-11-10 10:31:38,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:31:38" (1/1) ... [2018-11-10 10:31:38,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:31:39,020 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:31:39,532 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:31:39,543 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:31:39,757 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:31:39,772 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:31:39,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:39 WrapperNode [2018-11-10 10:31:39,773 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:31:39,774 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:31:39,774 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:31:39,774 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:31:39,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:39" (1/1) ... [2018-11-10 10:31:39,845 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:39" (1/1) ... [2018-11-10 10:31:39,891 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:31:39,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:31:39,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:31:39,892 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:31:39,900 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:39" (1/1) ... [2018-11-10 10:31:39,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:39" (1/1) ... [2018-11-10 10:31:39,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:39" (1/1) ... [2018-11-10 10:31:39,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:39" (1/1) ... [2018-11-10 10:31:39,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:39" (1/1) ... [2018-11-10 10:31:39,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:39" (1/1) ... [2018-11-10 10:31:39,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:39" (1/1) ... [2018-11-10 10:31:39,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:31:39,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:31:39,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:31:39,969 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:31:39,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:31:40,014 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 10:31:40,014 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 10:31:40,014 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-11-10 10:31:40,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-11-10 10:31:40,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 10:31:40,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 10:31:40,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:31:40,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:31:42,386 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 10:31:42,386 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 10:31:43,260 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:31:43,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:31:43 BoogieIcfgContainer [2018-11-10 10:31:43,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:31:43,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 10:31:43,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 10:31:43,264 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 10:31:43,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:31:38" (1/3) ... [2018-11-10 10:31:43,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f03c94c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:31:43, skipping insertion in model container [2018-11-10 10:31:43,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:31:39" (2/3) ... [2018-11-10 10:31:43,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f03c94c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:31:43, skipping insertion in model container [2018-11-10 10:31:43,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:31:43" (3/3) ... [2018-11-10 10:31:43,266 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.06_false-unreach-call.i.cil.c [2018-11-10 10:31:43,271 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 10:31:43,276 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 10:31:43,284 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 10:31:43,303 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:31:43,303 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 10:31:43,304 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 10:31:43,304 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 10:31:43,304 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:31:43,304 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:31:43,304 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 10:31:43,304 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:31:43,304 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 10:31:43,316 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states. [2018-11-10 10:31:43,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-10 10:31:43,321 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:43,322 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, 1, 1] [2018-11-10 10:31:43,323 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:31:43,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:43,326 INFO L82 PathProgramCache]: Analyzing trace with hash -264402800, now seen corresponding path program 1 times [2018-11-10 10:31:43,329 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:31:43,330 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:31:43,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:43,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:43,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 13 treesize of output 10 [2018-11-10 10:31:43,851 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 10:31:43,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:43,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:43,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:43,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:31:43,896 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 10:31:43,900 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:43,902 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 10:31:43,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:43,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:43,917 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 10:31:43,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:31:43,945 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 10:31:43,945 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:31:43,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:31:43,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:31:43,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:31:43,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:31:43,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:31:43,966 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 6 states. [2018-11-10 10:31:46,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:31:46,584 INFO L93 Difference]: Finished difference Result 358 states and 605 transitions. [2018-11-10 10:31:46,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:31:46,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-11-10 10:31:46,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:31:46,594 INFO L225 Difference]: With dead ends: 358 [2018-11-10 10:31:46,594 INFO L226 Difference]: Without dead ends: 182 [2018-11-10 10:31:46,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 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 10:31:46,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-10 10:31:46,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2018-11-10 10:31:46,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-10 10:31:46,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 256 transitions. [2018-11-10 10:31:46,633 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 256 transitions. Word has length 51 [2018-11-10 10:31:46,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:31:46,633 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 256 transitions. [2018-11-10 10:31:46,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:31:46,634 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 256 transitions. [2018-11-10 10:31:46,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 10:31:46,635 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:46,636 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, 1, 1] [2018-11-10 10:31:46,636 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:31:46,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:46,636 INFO L82 PathProgramCache]: Analyzing trace with hash -311734117, now seen corresponding path program 1 times [2018-11-10 10:31:46,637 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:31:46,637 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:31:46,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:47,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:47,248 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 10:31:47,249 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 10:31:47,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:47,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:47,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:47,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:31:47,277 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 10:31:47,280 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:47,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:31:47,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:47,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:47,296 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 10:31:47,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:31:47,300 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 10:31:47,302 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 10:31:47,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:47,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:47,310 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 10:31:47,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:31:47,338 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 10:31:47,339 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:31:47,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:31:47,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:31:47,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:31:47,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:31:47,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:31:47,344 INFO L87 Difference]: Start difference. First operand 165 states and 256 transitions. Second operand 6 states. [2018-11-10 10:31:49,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:31:49,897 INFO L93 Difference]: Finished difference Result 321 states and 496 transitions. [2018-11-10 10:31:49,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:31:49,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-11-10 10:31:49,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:31:49,898 INFO L225 Difference]: With dead ends: 321 [2018-11-10 10:31:49,898 INFO L226 Difference]: Without dead ends: 182 [2018-11-10 10:31:49,899 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 10:31:49,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-10 10:31:49,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2018-11-10 10:31:49,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-10 10:31:49,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 255 transitions. [2018-11-10 10:31:49,907 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 255 transitions. Word has length 65 [2018-11-10 10:31:49,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:31:49,908 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 255 transitions. [2018-11-10 10:31:49,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:31:49,908 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 255 transitions. [2018-11-10 10:31:49,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 10:31:49,909 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:49,910 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, 1] [2018-11-10 10:31:49,910 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:31:49,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:49,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1166381172, now seen corresponding path program 1 times [2018-11-10 10:31:49,912 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:31:49,912 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:31:49,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:50,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:50,262 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 10:31:50,264 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 10:31:50,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:50,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:50,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:50,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:31:50,274 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 10:31:50,291 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 10:31:50,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:50,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:50,299 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 10:31:50,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:31:50,309 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 10:31:50,309 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:31:50,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:31:50,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:31:50,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:31:50,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:31:50,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:31:50,313 INFO L87 Difference]: Start difference. First operand 165 states and 255 transitions. Second operand 4 states. [2018-11-10 10:31:52,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:31:52,714 INFO L93 Difference]: Finished difference Result 334 states and 518 transitions. [2018-11-10 10:31:52,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:31:52,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-11-10 10:31:52,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:31:52,716 INFO L225 Difference]: With dead ends: 334 [2018-11-10 10:31:52,716 INFO L226 Difference]: Without dead ends: 195 [2018-11-10 10:31:52,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 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 10:31:52,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-10 10:31:52,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 182. [2018-11-10 10:31:52,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-10 10:31:52,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 282 transitions. [2018-11-10 10:31:52,726 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 282 transitions. Word has length 66 [2018-11-10 10:31:52,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:31:52,727 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 282 transitions. [2018-11-10 10:31:52,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:31:52,727 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 282 transitions. [2018-11-10 10:31:52,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 10:31:52,728 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:52,729 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, 1] [2018-11-10 10:31:52,729 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:31:52,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:52,729 INFO L82 PathProgramCache]: Analyzing trace with hash 284791744, now seen corresponding path program 1 times [2018-11-10 10:31:52,729 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:31:52,730 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:31:52,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:53,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:53,024 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 10:31:53,026 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 10:31:53,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:53,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:53,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:53,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:31:53,053 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 10:31:53,059 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 10:31:53,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:53,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:53,062 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 10:31:53,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:31:53,079 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 10:31:53,079 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:31:53,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:31:53,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:31:53,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:31:53,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:31:53,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:31:53,083 INFO L87 Difference]: Start difference. First operand 182 states and 282 transitions. Second operand 4 states. [2018-11-10 10:31:55,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:31:55,680 INFO L93 Difference]: Finished difference Result 459 states and 719 transitions. [2018-11-10 10:31:55,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:31:55,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-11-10 10:31:55,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:31:55,681 INFO L225 Difference]: With dead ends: 459 [2018-11-10 10:31:55,681 INFO L226 Difference]: Without dead ends: 303 [2018-11-10 10:31:55,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 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 10:31:55,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-11-10 10:31:55,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 223. [2018-11-10 10:31:55,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-11-10 10:31:55,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 356 transitions. [2018-11-10 10:31:55,692 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 356 transitions. Word has length 66 [2018-11-10 10:31:55,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:31:55,692 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 356 transitions. [2018-11-10 10:31:55,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:31:55,692 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 356 transitions. [2018-11-10 10:31:55,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 10:31:55,693 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:55,693 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, 1, 1] [2018-11-10 10:31:55,693 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:31:55,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:55,694 INFO L82 PathProgramCache]: Analyzing trace with hash -215859777, now seen corresponding path program 1 times [2018-11-10 10:31:55,694 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:31:55,694 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:31:55,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:56,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:56,202 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 10:31:56,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 10:31:56,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:56,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:56,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:56,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:31:56,227 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 10:31:56,230 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:56,231 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 10:31:56,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:56,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:56,244 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 10:31:56,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:31:56,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:31:56,249 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 10:31:56,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:56,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:56,251 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 10:31:56,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:31:56,259 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 10:31:56,259 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:31:56,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:31:56,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:31:56,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:31:56,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:31:56,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:31:56,263 INFO L87 Difference]: Start difference. First operand 223 states and 356 transitions. Second operand 6 states. [2018-11-10 10:31:58,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:31:58,773 INFO L93 Difference]: Finished difference Result 435 states and 695 transitions. [2018-11-10 10:31:58,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:31:58,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-10 10:31:58,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:31:58,775 INFO L225 Difference]: With dead ends: 435 [2018-11-10 10:31:58,775 INFO L226 Difference]: Without dead ends: 238 [2018-11-10 10:31:58,775 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 10:31:58,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-11-10 10:31:58,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 223. [2018-11-10 10:31:58,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-11-10 10:31:58,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 355 transitions. [2018-11-10 10:31:58,784 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 355 transitions. Word has length 66 [2018-11-10 10:31:58,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:31:58,785 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 355 transitions. [2018-11-10 10:31:58,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:31:58,785 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 355 transitions. [2018-11-10 10:31:58,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 10:31:58,786 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:31:58,786 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, 1, 1] [2018-11-10 10:31:58,786 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:31:58,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:31:58,787 INFO L82 PathProgramCache]: Analyzing trace with hash -2048488820, now seen corresponding path program 1 times [2018-11-10 10:31:58,787 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:31:58,787 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:31:58,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:31:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:31:59,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:31:59,419 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 10:31:59,421 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 10:31:59,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:59,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:59,430 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 10:31:59,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-10 10:31:59,459 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 10:31:59,463 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:59,465 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 10:31:59,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:59,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:59,478 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 10:31:59,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:31:59,483 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 10:31:59,486 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:59,487 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 10:31:59,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:59,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:59,502 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 10:31:59,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:31:59,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 10:31:59,510 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:31:59,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 10:31:59,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:59,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:59,524 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 10:31:59,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:31:59,528 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 10:31:59,532 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 10:31:59,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:31:59,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:31:59,534 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 10:31:59,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:5 [2018-11-10 10:31:59,545 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 10:31:59,545 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:31:59,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:31:59,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 10:31:59,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 10:31:59,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 10:31:59,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:31:59,548 INFO L87 Difference]: Start difference. First operand 223 states and 355 transitions. Second operand 8 states. [2018-11-10 10:32:04,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:32:04,445 INFO L93 Difference]: Finished difference Result 429 states and 687 transitions. [2018-11-10 10:32:04,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 10:32:04,445 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2018-11-10 10:32:04,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:32:04,446 INFO L225 Difference]: With dead ends: 429 [2018-11-10 10:32:04,446 INFO L226 Difference]: Without dead ends: 232 [2018-11-10 10:32:04,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 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 10:32:04,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-11-10 10:32:04,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2018-11-10 10:32:04,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-10 10:32:04,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 366 transitions. [2018-11-10 10:32:04,453 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 366 transitions. Word has length 67 [2018-11-10 10:32:04,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:32:04,454 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 366 transitions. [2018-11-10 10:32:04,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 10:32:04,454 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 366 transitions. [2018-11-10 10:32:04,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 10:32:04,455 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:32:04,455 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, 1, 1] [2018-11-10 10:32:04,455 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:32:04,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:04,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1839958664, now seen corresponding path program 1 times [2018-11-10 10:32:04,456 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:32:04,456 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:32:04,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:05,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:05,011 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 10:32:05,013 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 10:32:05,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:05,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:05,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:05,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:32:05,032 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 10:32:05,034 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:05,035 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 10:32:05,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:05,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:05,048 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 10:32:05,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:32:05,055 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 10:32:05,057 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 10:32:05,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:05,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:05,060 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 10:32:05,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:32:05,069 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 10:32:05,069 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:32:05,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:32:05,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:32:05,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:32:05,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:32:05,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:32:05,072 INFO L87 Difference]: Start difference. First operand 232 states and 366 transitions. Second operand 6 states. [2018-11-10 10:32:07,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:32:07,657 INFO L93 Difference]: Finished difference Result 462 states and 727 transitions. [2018-11-10 10:32:07,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:32:07,657 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-11-10 10:32:07,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:32:07,658 INFO L225 Difference]: With dead ends: 462 [2018-11-10 10:32:07,659 INFO L226 Difference]: Without dead ends: 256 [2018-11-10 10:32:07,659 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 10:32:07,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-11-10 10:32:07,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 232. [2018-11-10 10:32:07,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-10 10:32:07,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 365 transitions. [2018-11-10 10:32:07,669 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 365 transitions. Word has length 67 [2018-11-10 10:32:07,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:32:07,669 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 365 transitions. [2018-11-10 10:32:07,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:32:07,669 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 365 transitions. [2018-11-10 10:32:07,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 10:32:07,670 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:32:07,670 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, 1, 1] [2018-11-10 10:32:07,670 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:32:07,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:07,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1267965161, now seen corresponding path program 1 times [2018-11-10 10:32:07,671 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:32:07,671 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:32:07,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:07,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:07,959 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 10:32:07,961 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 10:32:07,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:07,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:07,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:07,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:32:07,975 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 10:32:07,977 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 10:32:07,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:07,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:07,979 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 10:32:07,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:32:07,986 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 10:32:07,986 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:32:07,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:32:07,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:32:07,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:32:07,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:32:07,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:32:07,989 INFO L87 Difference]: Start difference. First operand 232 states and 365 transitions. Second operand 4 states. [2018-11-10 10:32:10,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:32:10,590 INFO L93 Difference]: Finished difference Result 518 states and 810 transitions. [2018-11-10 10:32:10,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:32:10,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-11-10 10:32:10,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:32:10,592 INFO L225 Difference]: With dead ends: 518 [2018-11-10 10:32:10,592 INFO L226 Difference]: Without dead ends: 312 [2018-11-10 10:32:10,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 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 10:32:10,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-11-10 10:32:10,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 233. [2018-11-10 10:32:10,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-10 10:32:10,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 366 transitions. [2018-11-10 10:32:10,603 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 366 transitions. Word has length 67 [2018-11-10 10:32:10,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:32:10,604 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 366 transitions. [2018-11-10 10:32:10,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:32:10,604 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 366 transitions. [2018-11-10 10:32:10,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-10 10:32:10,605 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:32:10,605 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, 1, 1] [2018-11-10 10:32:10,605 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:32:10,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:10,605 INFO L82 PathProgramCache]: Analyzing trace with hash -56165668, now seen corresponding path program 1 times [2018-11-10 10:32:10,606 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:32:10,606 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:32:10,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:11,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:11,200 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 10:32:11,201 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 10:32:11,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:11,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:11,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:11,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:32:11,236 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 10:32:11,238 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:11,240 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 10:32:11,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:11,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:11,253 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 10:32:11,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:32:11,256 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 10:32:11,257 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 10:32:11,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:11,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:11,261 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 10:32:11,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:32:11,272 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 10:32:11,272 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:32:11,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:32:11,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:32:11,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:32:11,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:32:11,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:32:11,276 INFO L87 Difference]: Start difference. First operand 233 states and 366 transitions. Second operand 6 states. [2018-11-10 10:32:13,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:32:13,876 INFO L93 Difference]: Finished difference Result 464 states and 728 transitions. [2018-11-10 10:32:13,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:32:13,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-10 10:32:13,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:32:13,877 INFO L225 Difference]: With dead ends: 464 [2018-11-10 10:32:13,878 INFO L226 Difference]: Without dead ends: 257 [2018-11-10 10:32:13,878 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 10:32:13,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-11-10 10:32:13,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 233. [2018-11-10 10:32:13,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-10 10:32:13,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 365 transitions. [2018-11-10 10:32:13,889 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 365 transitions. Word has length 68 [2018-11-10 10:32:13,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:32:13,889 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 365 transitions. [2018-11-10 10:32:13,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:32:13,889 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 365 transitions. [2018-11-10 10:32:13,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 10:32:13,890 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:32:13,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, 1, 1] [2018-11-10 10:32:13,890 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:32:13,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:13,890 INFO L82 PathProgramCache]: Analyzing trace with hash -934716622, now seen corresponding path program 1 times [2018-11-10 10:32:13,891 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:32:13,891 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:32:13,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:14,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:14,449 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 10:32:14,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:32:14,454 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:14,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 10:32:14,457 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:14,464 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:14,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:14,475 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 10:32:14,475 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:32:14,502 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 10:32:14,502 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:32:14,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:32:14,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:32:14,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:32:14,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:32:14,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:32:14,505 INFO L87 Difference]: Start difference. First operand 233 states and 365 transitions. Second operand 7 states. [2018-11-10 10:32:17,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:32:17,288 INFO L93 Difference]: Finished difference Result 493 states and 775 transitions. [2018-11-10 10:32:17,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:32:17,289 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2018-11-10 10:32:17,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:32:17,290 INFO L225 Difference]: With dead ends: 493 [2018-11-10 10:32:17,290 INFO L226 Difference]: Without dead ends: 286 [2018-11-10 10:32:17,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 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 10:32:17,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-11-10 10:32:17,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 256. [2018-11-10 10:32:17,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-10 10:32:17,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 404 transitions. [2018-11-10 10:32:17,304 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 404 transitions. Word has length 69 [2018-11-10 10:32:17,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:32:17,304 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 404 transitions. [2018-11-10 10:32:17,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:32:17,304 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 404 transitions. [2018-11-10 10:32:17,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 10:32:17,305 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:32:17,306 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, 1, 1] [2018-11-10 10:32:17,306 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:32:17,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:17,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1795858285, now seen corresponding path program 1 times [2018-11-10 10:32:17,307 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:32:17,307 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:32:17,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:17,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:17,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 13 treesize of output 10 [2018-11-10 10:32:17,879 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 10:32:17,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:17,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:17,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:17,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:32:17,901 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 10:32:17,903 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:17,905 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 10:32:17,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:17,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:17,920 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 10:32:17,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:32:17,923 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 10:32:17,927 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 10:32:17,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:17,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:17,932 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 10:32:17,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:32:17,941 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 10:32:17,941 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:32:17,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:32:17,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:32:17,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:32:17,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:32:17,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:32:17,945 INFO L87 Difference]: Start difference. First operand 256 states and 404 transitions. Second operand 6 states. [2018-11-10 10:32:20,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:32:20,545 INFO L93 Difference]: Finished difference Result 510 states and 805 transitions. [2018-11-10 10:32:20,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:32:20,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-10 10:32:20,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:32:20,547 INFO L225 Difference]: With dead ends: 510 [2018-11-10 10:32:20,547 INFO L226 Difference]: Without dead ends: 280 [2018-11-10 10:32:20,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 64 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 10:32:20,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-11-10 10:32:20,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 256. [2018-11-10 10:32:20,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-10 10:32:20,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 403 transitions. [2018-11-10 10:32:20,557 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 403 transitions. Word has length 69 [2018-11-10 10:32:20,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:32:20,557 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 403 transitions. [2018-11-10 10:32:20,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:32:20,557 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 403 transitions. [2018-11-10 10:32:20,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 10:32:20,558 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:32:20,558 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, 1, 1] [2018-11-10 10:32:20,558 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:32:20,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:20,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1094455209, now seen corresponding path program 1 times [2018-11-10 10:32:20,559 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:32:20,559 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:32:20,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:21,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:21,180 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 10:32:21,181 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 10:32:21,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:21,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:21,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:21,202 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:32:21,216 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 10:32:21,219 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:21,220 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 10:32:21,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:21,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:21,232 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 10:32:21,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:32:21,235 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 10:32:21,238 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 10:32:21,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:21,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:21,244 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 10:32:21,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:32:21,255 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 10:32:21,256 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:32:21,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:32:21,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:32:21,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:32:21,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:32:21,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:32:21,259 INFO L87 Difference]: Start difference. First operand 256 states and 403 transitions. Second operand 6 states. [2018-11-10 10:32:23,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:32:23,876 INFO L93 Difference]: Finished difference Result 500 states and 791 transitions. [2018-11-10 10:32:23,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:32:23,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-11-10 10:32:23,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:32:23,878 INFO L225 Difference]: With dead ends: 500 [2018-11-10 10:32:23,878 INFO L226 Difference]: Without dead ends: 270 [2018-11-10 10:32:23,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 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 10:32:23,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-11-10 10:32:23,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 256. [2018-11-10 10:32:23,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-10 10:32:23,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 402 transitions. [2018-11-10 10:32:23,888 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 402 transitions. Word has length 70 [2018-11-10 10:32:23,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:32:23,888 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 402 transitions. [2018-11-10 10:32:23,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:32:23,888 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 402 transitions. [2018-11-10 10:32:23,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 10:32:23,889 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:32:23,889 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, 1, 1] [2018-11-10 10:32:23,889 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:32:23,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:23,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1812314495, now seen corresponding path program 1 times [2018-11-10 10:32:23,890 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:32:23,890 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:32:23,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:24,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:24,597 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 10:32:24,599 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 10:32:24,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:24,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:24,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:24,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:32:24,618 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 10:32:24,620 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:24,622 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 10:32:24,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:24,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:24,638 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 10:32:24,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:32:24,640 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 10:32:24,642 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 10:32:24,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:24,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:24,647 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 10:32:24,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:32:24,658 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 10:32:24,658 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:32:24,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:32:24,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:32:24,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:32:24,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:32:24,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:32:24,662 INFO L87 Difference]: Start difference. First operand 256 states and 402 transitions. Second operand 6 states. [2018-11-10 10:32:27,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:32:27,249 INFO L93 Difference]: Finished difference Result 490 states and 778 transitions. [2018-11-10 10:32:27,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:32:27,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-11-10 10:32:27,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:32:27,250 INFO L225 Difference]: With dead ends: 490 [2018-11-10 10:32:27,250 INFO L226 Difference]: Without dead ends: 260 [2018-11-10 10:32:27,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 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 10:32:27,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-11-10 10:32:27,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 256. [2018-11-10 10:32:27,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-10 10:32:27,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 401 transitions. [2018-11-10 10:32:27,256 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 401 transitions. Word has length 80 [2018-11-10 10:32:27,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:32:27,257 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 401 transitions. [2018-11-10 10:32:27,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:32:27,257 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 401 transitions. [2018-11-10 10:32:27,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 10:32:27,257 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:32:27,257 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, 1, 1] [2018-11-10 10:32:27,258 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:32:27,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:27,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1541146571, now seen corresponding path program 1 times [2018-11-10 10:32:27,258 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:32:27,258 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:32:27,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:27,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:27,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 10:32:27,609 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 10:32:27,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:27,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:27,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:27,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:32:27,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 19 treesize of output 15 [2018-11-10 10:32:27,624 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 10:32:27,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:27,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:27,627 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 10:32:27,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:32:27,633 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 10:32:27,634 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:32:27,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:32:27,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:32:27,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:32:27,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:32:27,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:32:27,637 INFO L87 Difference]: Start difference. First operand 256 states and 401 transitions. Second operand 4 states. [2018-11-10 10:32:30,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:32:30,242 INFO L93 Difference]: Finished difference Result 565 states and 884 transitions. [2018-11-10 10:32:30,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:32:30,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-11-10 10:32:30,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:32:30,243 INFO L225 Difference]: With dead ends: 565 [2018-11-10 10:32:30,243 INFO L226 Difference]: Without dead ends: 335 [2018-11-10 10:32:30,243 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 10:32:30,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-11-10 10:32:30,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 256. [2018-11-10 10:32:30,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-10 10:32:30,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 400 transitions. [2018-11-10 10:32:30,254 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 400 transitions. Word has length 80 [2018-11-10 10:32:30,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:32:30,254 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 400 transitions. [2018-11-10 10:32:30,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:32:30,254 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 400 transitions. [2018-11-10 10:32:30,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 10:32:30,255 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:32:30,255 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, 1, 1] [2018-11-10 10:32:30,255 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:32:30,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:30,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1388866703, now seen corresponding path program 1 times [2018-11-10 10:32:30,256 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:32:30,256 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:32:30,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:30,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:30,625 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 10:32:30,627 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 10:32:30,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:30,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:30,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:30,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:32:30,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:32:30,641 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 10:32:30,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:30,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:30,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 10:32:30,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:32:30,660 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 10:32:30,660 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:32:30,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:32:30,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:32:30,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:32:30,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:32:30,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:32:30,663 INFO L87 Difference]: Start difference. First operand 256 states and 400 transitions. Second operand 4 states. [2018-11-10 10:32:33,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:32:33,220 INFO L93 Difference]: Finished difference Result 563 states and 880 transitions. [2018-11-10 10:32:33,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:32:33,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-11-10 10:32:33,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:32:33,221 INFO L225 Difference]: With dead ends: 563 [2018-11-10 10:32:33,221 INFO L226 Difference]: Without dead ends: 333 [2018-11-10 10:32:33,222 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 10:32:33,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-11-10 10:32:33,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 256. [2018-11-10 10:32:33,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-10 10:32:33,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 399 transitions. [2018-11-10 10:32:33,229 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 399 transitions. Word has length 81 [2018-11-10 10:32:33,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:32:33,230 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 399 transitions. [2018-11-10 10:32:33,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:32:33,230 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 399 transitions. [2018-11-10 10:32:33,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 10:32:33,230 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:32:33,230 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, 1, 1] [2018-11-10 10:32:33,231 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:32:33,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:33,231 INFO L82 PathProgramCache]: Analyzing trace with hash 661921960, now seen corresponding path program 1 times [2018-11-10 10:32:33,231 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:32:33,231 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:32:33,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:33,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:33,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:33,589 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 10:32:33,591 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 10:32:33,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:33,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:33,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:33,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:32:33,602 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 10:32:33,604 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 10:32:33,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:33,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:33,607 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 10:32:33,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:32:33,615 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 10:32:33,615 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:32:33,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:32:33,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:32:33,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:32:33,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:32:33,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:32:33,618 INFO L87 Difference]: Start difference. First operand 256 states and 399 transitions. Second operand 4 states. [2018-11-10 10:32:36,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:32:36,185 INFO L93 Difference]: Finished difference Result 563 states and 878 transitions. [2018-11-10 10:32:36,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:32:36,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-11-10 10:32:36,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:32:36,186 INFO L225 Difference]: With dead ends: 563 [2018-11-10 10:32:36,187 INFO L226 Difference]: Without dead ends: 333 [2018-11-10 10:32:36,187 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 10:32:36,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-11-10 10:32:36,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 256. [2018-11-10 10:32:36,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-10 10:32:36,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 398 transitions. [2018-11-10 10:32:36,198 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 398 transitions. Word has length 82 [2018-11-10 10:32:36,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:32:36,198 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 398 transitions. [2018-11-10 10:32:36,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:32:36,198 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 398 transitions. [2018-11-10 10:32:36,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 10:32:36,199 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:32:36,199 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, 1, 1] [2018-11-10 10:32:36,199 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:32:36,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:36,199 INFO L82 PathProgramCache]: Analyzing trace with hash 192722348, now seen corresponding path program 1 times [2018-11-10 10:32:36,200 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:32:36,200 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:32:36,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:36,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:36,559 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 10:32:36,561 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 10:32:36,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:36,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:36,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:36,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:32:36,573 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 10:32:36,575 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 10:32:36,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:36,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:36,580 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 10:32:36,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:32:36,586 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 10:32:36,586 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:32:36,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:32:36,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:32:36,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:32:36,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:32:36,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:32:36,589 INFO L87 Difference]: Start difference. First operand 256 states and 398 transitions. Second operand 4 states. [2018-11-10 10:32:39,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:32:39,145 INFO L93 Difference]: Finished difference Result 563 states and 876 transitions. [2018-11-10 10:32:39,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:32:39,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-11-10 10:32:39,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:32:39,146 INFO L225 Difference]: With dead ends: 563 [2018-11-10 10:32:39,146 INFO L226 Difference]: Without dead ends: 333 [2018-11-10 10:32:39,147 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 10:32:39,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-11-10 10:32:39,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 256. [2018-11-10 10:32:39,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-10 10:32:39,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 397 transitions. [2018-11-10 10:32:39,154 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 397 transitions. Word has length 83 [2018-11-10 10:32:39,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:32:39,154 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 397 transitions. [2018-11-10 10:32:39,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:32:39,154 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 397 transitions. [2018-11-10 10:32:39,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 10:32:39,155 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:32:39,155 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, 1, 1] [2018-11-10 10:32:39,155 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:32:39,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:39,155 INFO L82 PathProgramCache]: Analyzing trace with hash 809033661, now seen corresponding path program 1 times [2018-11-10 10:32:39,156 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:32:39,156 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:32:39,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:39,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:39,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:32:39,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:32:39,807 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:39,808 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 10:32:39,809 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:39,814 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:39,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:39,826 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 10:32:39,826 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:32:39,836 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 10:32:39,838 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 10:32:39,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:39,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:39,840 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 10:32:39,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:32:39,849 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 10:32:39,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:32:39,876 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 10:32:39,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:39,877 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 10:32:39,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 10:32:39,883 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 10:32:39,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:32:39,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 10:32:39,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:32:39,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:32:39,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:32:39,887 INFO L87 Difference]: Start difference. First operand 256 states and 397 transitions. Second operand 9 states. [2018-11-10 10:32:42,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:32:42,895 INFO L93 Difference]: Finished difference Result 659 states and 1026 transitions. [2018-11-10 10:32:42,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:32:42,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2018-11-10 10:32:42,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:32:42,897 INFO L225 Difference]: With dead ends: 659 [2018-11-10 10:32:42,897 INFO L226 Difference]: Without dead ends: 429 [2018-11-10 10:32:42,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 161 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 10:32:42,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-11-10 10:32:42,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 273. [2018-11-10 10:32:42,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-11-10 10:32:42,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 423 transitions. [2018-11-10 10:32:42,905 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 423 transitions. Word has length 83 [2018-11-10 10:32:42,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:32:42,905 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 423 transitions. [2018-11-10 10:32:42,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:32:42,905 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 423 transitions. [2018-11-10 10:32:42,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 10:32:42,906 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:32:42,906 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, 1, 1] [2018-11-10 10:32:42,906 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:32:42,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:42,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1624702915, now seen corresponding path program 1 times [2018-11-10 10:32:42,907 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:32:42,907 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:32:42,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:43,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:43,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 13 treesize of output 10 [2018-11-10 10:32:43,265 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 10:32:43,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:43,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:43,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:43,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:32:43,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 10:32:43,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:32:43,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:43,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:43,279 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 10:32:43,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:32:43,285 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 10:32:43,285 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:32:43,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:32:43,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:32:43,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:32:43,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:32:43,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:32:43,288 INFO L87 Difference]: Start difference. First operand 273 states and 423 transitions. Second operand 4 states. [2018-11-10 10:32:45,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:32:45,894 INFO L93 Difference]: Finished difference Result 597 states and 926 transitions. [2018-11-10 10:32:45,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:32:45,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2018-11-10 10:32:45,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:32:45,896 INFO L225 Difference]: With dead ends: 597 [2018-11-10 10:32:45,896 INFO L226 Difference]: Without dead ends: 350 [2018-11-10 10:32:45,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 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 10:32:45,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-11-10 10:32:45,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 273. [2018-11-10 10:32:45,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-11-10 10:32:45,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 422 transitions. [2018-11-10 10:32:45,904 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 422 transitions. Word has length 84 [2018-11-10 10:32:45,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:32:45,904 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 422 transitions. [2018-11-10 10:32:45,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:32:45,904 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 422 transitions. [2018-11-10 10:32:45,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 10:32:45,904 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:32:45,905 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, 1, 1] [2018-11-10 10:32:45,905 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:32:45,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:45,905 INFO L82 PathProgramCache]: Analyzing trace with hash 168202973, now seen corresponding path program 1 times [2018-11-10 10:32:45,905 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:32:45,905 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:32:45,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:46,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:46,597 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 10:32:46,599 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 10:32:46,603 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:46,605 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 10:32:46,606 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:46,612 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:46,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:46,625 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 10:32:46,626 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:32:46,635 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 10:32:46,637 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 10:32:46,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:46,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:46,639 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 10:32:46,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:32:46,647 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 10:32:46,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:32:46,680 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 10:32:46,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:46,681 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 10:32:46,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 10:32:46,686 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 10:32:46,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:32:46,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 10:32:46,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:32:46,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:32:46,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:32:46,690 INFO L87 Difference]: Start difference. First operand 273 states and 422 transitions. Second operand 9 states. [2018-11-10 10:32:49,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:32:49,886 INFO L93 Difference]: Finished difference Result 674 states and 1046 transitions. [2018-11-10 10:32:49,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:32:49,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2018-11-10 10:32:49,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:32:49,888 INFO L225 Difference]: With dead ends: 674 [2018-11-10 10:32:49,888 INFO L226 Difference]: Without dead ends: 427 [2018-11-10 10:32:49,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:32:49,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-11-10 10:32:49,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 274. [2018-11-10 10:32:49,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-11-10 10:32:49,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 422 transitions. [2018-11-10 10:32:49,898 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 422 transitions. Word has length 84 [2018-11-10 10:32:49,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:32:49,898 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 422 transitions. [2018-11-10 10:32:49,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:32:49,898 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 422 transitions. [2018-11-10 10:32:49,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 10:32:49,899 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:32:49,899 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, 1, 1] [2018-11-10 10:32:49,899 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:32:49,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:49,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1863726887, now seen corresponding path program 1 times [2018-11-10 10:32:49,900 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:32:49,900 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:32:49,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:50,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:50,323 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 10:32:50,324 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 10:32:50,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:50,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:50,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:50,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:32:50,335 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 10:32:50,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:32:50,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:50,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:50,341 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 10:32:50,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:32:50,347 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 10:32:50,347 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:32:50,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:32:50,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:32:50,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:32:50,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:32:50,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:32:50,350 INFO L87 Difference]: Start difference. First operand 274 states and 422 transitions. Second operand 4 states. [2018-11-10 10:32:52,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:32:52,918 INFO L93 Difference]: Finished difference Result 589 states and 911 transitions. [2018-11-10 10:32:52,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:32:52,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-11-10 10:32:52,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:32:52,919 INFO L225 Difference]: With dead ends: 589 [2018-11-10 10:32:52,919 INFO L226 Difference]: Without dead ends: 341 [2018-11-10 10:32:52,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 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 10:32:52,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-11-10 10:32:52,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 274. [2018-11-10 10:32:52,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-11-10 10:32:52,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 421 transitions. [2018-11-10 10:32:52,935 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 421 transitions. Word has length 85 [2018-11-10 10:32:52,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:32:52,935 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 421 transitions. [2018-11-10 10:32:52,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:32:52,935 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 421 transitions. [2018-11-10 10:32:52,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 10:32:52,936 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:32:52,936 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, 1, 1] [2018-11-10 10:32:52,936 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:32:52,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:52,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1476051994, now seen corresponding path program 1 times [2018-11-10 10:32:52,937 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:32:52,937 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:32:52,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:53,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:53,651 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 10:32:53,653 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 10:32:53,658 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:53,660 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 10:32:53,660 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:53,667 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:53,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:53,682 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 10:32:53,682 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:32:53,694 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 10:32:53,697 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 10:32:53,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:53,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:53,701 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 10:32:53,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:32:53,714 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 10:32:53,714 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:32:53,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:32:53,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:32:53,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:32:53,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:32:53,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:32:53,718 INFO L87 Difference]: Start difference. First operand 274 states and 421 transitions. Second operand 7 states. [2018-11-10 10:32:54,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:32:54,434 INFO L93 Difference]: Finished difference Result 550 states and 848 transitions. [2018-11-10 10:32:54,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:32:54,435 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-11-10 10:32:54,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:32:54,436 INFO L225 Difference]: With dead ends: 550 [2018-11-10 10:32:54,436 INFO L226 Difference]: Without dead ends: 302 [2018-11-10 10:32:54,436 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 10:32:54,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-11-10 10:32:54,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 274. [2018-11-10 10:32:54,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-11-10 10:32:54,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 420 transitions. [2018-11-10 10:32:54,445 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 420 transitions. Word has length 85 [2018-11-10 10:32:54,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:32:54,446 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 420 transitions. [2018-11-10 10:32:54,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:32:54,446 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 420 transitions. [2018-11-10 10:32:54,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 10:32:54,446 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:32:54,446 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, 1, 1] [2018-11-10 10:32:54,446 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:32:54,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:54,447 INFO L82 PathProgramCache]: Analyzing trace with hash -339050374, now seen corresponding path program 1 times [2018-11-10 10:32:54,447 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:32:54,447 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:32:54,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:55,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:55,173 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 10:32:55,175 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 10:32:55,178 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:55,180 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 10:32:55,180 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:55,189 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:55,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:55,201 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 10:32:55,201 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:32:55,213 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 10:32:55,215 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 10:32:55,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:55,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:55,219 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 10:32:55,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:32:55,246 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 10:32:55,246 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:32:55,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:32:55,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:32:55,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:32:55,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:32:55,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:32:55,251 INFO L87 Difference]: Start difference. First operand 274 states and 420 transitions. Second operand 7 states. [2018-11-10 10:32:58,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:32:58,012 INFO L93 Difference]: Finished difference Result 550 states and 846 transitions. [2018-11-10 10:32:58,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:32:58,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2018-11-10 10:32:58,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:32:58,013 INFO L225 Difference]: With dead ends: 550 [2018-11-10 10:32:58,013 INFO L226 Difference]: Without dead ends: 302 [2018-11-10 10:32:58,014 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 10:32:58,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-11-10 10:32:58,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 274. [2018-11-10 10:32:58,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-11-10 10:32:58,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 419 transitions. [2018-11-10 10:32:58,023 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 419 transitions. Word has length 86 [2018-11-10 10:32:58,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:32:58,023 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 419 transitions. [2018-11-10 10:32:58,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:32:58,023 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 419 transitions. [2018-11-10 10:32:58,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 10:32:58,024 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:32:58,024 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, 1, 1] [2018-11-10 10:32:58,024 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:32:58,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:58,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1975349579, now seen corresponding path program 1 times [2018-11-10 10:32:58,025 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:32:58,025 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:32:58,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:58,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:58,764 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 10:32:58,765 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 10:32:58,773 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:58,775 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 10:32:58,776 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:58,781 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:58,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:58,792 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 10:32:58,792 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:32:58,801 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 10:32:58,803 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 10:32:58,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:58,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:58,806 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 10:32:58,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:32:58,817 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 10:32:58,817 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:32:58,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:32:58,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:32:58,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:32:58,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:32:58,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:32:58,820 INFO L87 Difference]: Start difference. First operand 274 states and 419 transitions. Second operand 7 states. [2018-11-10 10:33:01,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:01,621 INFO L93 Difference]: Finished difference Result 550 states and 844 transitions. [2018-11-10 10:33:01,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:33:01,621 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2018-11-10 10:33:01,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:01,622 INFO L225 Difference]: With dead ends: 550 [2018-11-10 10:33:01,622 INFO L226 Difference]: Without dead ends: 302 [2018-11-10 10:33:01,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 81 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 10:33:01,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-11-10 10:33:01,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 274. [2018-11-10 10:33:01,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-11-10 10:33:01,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 418 transitions. [2018-11-10 10:33:01,631 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 418 transitions. Word has length 87 [2018-11-10 10:33:01,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:01,631 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 418 transitions. [2018-11-10 10:33:01,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:33:01,632 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 418 transitions. [2018-11-10 10:33:01,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-10 10:33:01,632 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:01,632 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, 1, 1] [2018-11-10 10:33:01,632 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:01,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:01,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1931249269, now seen corresponding path program 1 times [2018-11-10 10:33:01,633 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:33:01,633 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:33:01,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:02,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:33:02,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 18 treesize of output 15 [2018-11-10 10:33:02,343 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 10:33:02,346 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:33:02,348 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 10:33:02,348 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:02,353 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:02,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:02,364 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 10:33:02,364 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:33:02,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:33:02,376 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 10:33:02,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:02,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:02,382 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 10:33:02,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:33:02,395 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 10:33:02,396 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:33:02,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:02,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:33:02,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:33:02,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:33:02,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:33:02,399 INFO L87 Difference]: Start difference. First operand 274 states and 418 transitions. Second operand 7 states. [2018-11-10 10:33:05,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:05,148 INFO L93 Difference]: Finished difference Result 540 states and 829 transitions. [2018-11-10 10:33:05,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:33:05,149 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2018-11-10 10:33:05,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:05,150 INFO L225 Difference]: With dead ends: 540 [2018-11-10 10:33:05,150 INFO L226 Difference]: Without dead ends: 292 [2018-11-10 10:33:05,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 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 10:33:05,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-11-10 10:33:05,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 274. [2018-11-10 10:33:05,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-11-10 10:33:05,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 417 transitions. [2018-11-10 10:33:05,158 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 417 transitions. Word has length 88 [2018-11-10 10:33:05,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:05,159 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 417 transitions. [2018-11-10 10:33:05,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:33:05,159 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 417 transitions. [2018-11-10 10:33:05,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 10:33:05,159 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:05,160 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, 1, 1] [2018-11-10 10:33:05,160 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:05,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:05,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1957671745, now seen corresponding path program 1 times [2018-11-10 10:33:05,160 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:33:05,160 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:33:05,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:05,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:33:05,286 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 10:33:05,286 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:33:05,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:05,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:33:05,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:33:05,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:33:05,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:05,289 INFO L87 Difference]: Start difference. First operand 274 states and 417 transitions. Second operand 3 states. [2018-11-10 10:33:05,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:05,358 INFO L93 Difference]: Finished difference Result 742 states and 1152 transitions. [2018-11-10 10:33:05,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:33:05,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2018-11-10 10:33:05,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:05,359 INFO L225 Difference]: With dead ends: 742 [2018-11-10 10:33:05,360 INFO L226 Difference]: Without dead ends: 494 [2018-11-10 10:33:05,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 87 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 10:33:05,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-11-10 10:33:05,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 492. [2018-11-10 10:33:05,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-11-10 10:33:05,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 743 transitions. [2018-11-10 10:33:05,388 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 743 transitions. Word has length 89 [2018-11-10 10:33:05,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:05,388 INFO L481 AbstractCegarLoop]: Abstraction has 492 states and 743 transitions. [2018-11-10 10:33:05,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:33:05,388 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 743 transitions. [2018-11-10 10:33:05,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 10:33:05,389 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:05,389 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, 1, 1] [2018-11-10 10:33:05,389 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:05,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:05,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1064185407, now seen corresponding path program 1 times [2018-11-10 10:33:05,390 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:33:05,390 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:33:05,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:05,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:33:05,791 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 10:33:05,793 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 10:33:05,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:05,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:05,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:05,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:33:05,805 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 10:33:05,807 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 10:33:05,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:05,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:05,809 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 10:33:05,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:33:05,816 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 10:33:05,816 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:33:05,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:05,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:33:05,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:33:05,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:33:05,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:33:05,819 INFO L87 Difference]: Start difference. First operand 492 states and 743 transitions. Second operand 4 states. [2018-11-10 10:33:08,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:08,414 INFO L93 Difference]: Finished difference Result 1091 states and 1634 transitions. [2018-11-10 10:33:08,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:33:08,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-11-10 10:33:08,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:08,416 INFO L225 Difference]: With dead ends: 1091 [2018-11-10 10:33:08,416 INFO L226 Difference]: Without dead ends: 625 [2018-11-10 10:33:08,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 86 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 10:33:08,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-11-10 10:33:08,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 492. [2018-11-10 10:33:08,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-11-10 10:33:08,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 741 transitions. [2018-11-10 10:33:08,433 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 741 transitions. Word has length 89 [2018-11-10 10:33:08,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:08,433 INFO L481 AbstractCegarLoop]: Abstraction has 492 states and 741 transitions. [2018-11-10 10:33:08,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:33:08,434 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 741 transitions. [2018-11-10 10:33:08,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 10:33:08,434 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:08,434 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, 1, 1] [2018-11-10 10:33:08,435 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:08,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:08,435 INFO L82 PathProgramCache]: Analyzing trace with hash 713056781, now seen corresponding path program 1 times [2018-11-10 10:33:08,435 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:33:08,435 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:33:08,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:08,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:33:08,836 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 10:33:08,851 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 10:33:08,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:08,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:08,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:08,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:33:08,866 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 10:33:08,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 10:33:08,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:08,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:08,870 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 10:33:08,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:33:08,879 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 10:33:08,879 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:33:08,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:08,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:33:08,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:33:08,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:33:08,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:33:08,882 INFO L87 Difference]: Start difference. First operand 492 states and 741 transitions. Second operand 4 states. [2018-11-10 10:33:11,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:11,498 INFO L93 Difference]: Finished difference Result 1091 states and 1630 transitions. [2018-11-10 10:33:11,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:33:11,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-11-10 10:33:11,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:11,499 INFO L225 Difference]: With dead ends: 1091 [2018-11-10 10:33:11,499 INFO L226 Difference]: Without dead ends: 625 [2018-11-10 10:33:11,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 86 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 10:33:11,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-11-10 10:33:11,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 492. [2018-11-10 10:33:11,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-11-10 10:33:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 739 transitions. [2018-11-10 10:33:11,522 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 739 transitions. Word has length 89 [2018-11-10 10:33:11,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:11,522 INFO L481 AbstractCegarLoop]: Abstraction has 492 states and 739 transitions. [2018-11-10 10:33:11,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:33:11,522 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 739 transitions. [2018-11-10 10:33:11,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-10 10:33:11,523 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:11,523 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, 1, 1] [2018-11-10 10:33:11,523 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:11,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:11,524 INFO L82 PathProgramCache]: Analyzing trace with hash -455390371, now seen corresponding path program 1 times [2018-11-10 10:33:11,524 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:33:11,524 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:33:11,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:11,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:33:11,892 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 10:33:11,893 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 10:33:11,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:11,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:11,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:11,899 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:33:11,905 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 10:33:11,906 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 10:33:11,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:11,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:11,912 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 10:33:11,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:33:11,919 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 10:33:11,919 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:33:11,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:11,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:33:11,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:33:11,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:33:11,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:33:11,922 INFO L87 Difference]: Start difference. First operand 492 states and 739 transitions. Second operand 4 states. [2018-11-10 10:33:14,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:14,608 INFO L93 Difference]: Finished difference Result 1083 states and 1615 transitions. [2018-11-10 10:33:14,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:33:14,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-11-10 10:33:14,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:14,609 INFO L225 Difference]: With dead ends: 1083 [2018-11-10 10:33:14,609 INFO L226 Difference]: Without dead ends: 617 [2018-11-10 10:33:14,610 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 10:33:14,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-11-10 10:33:14,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 492. [2018-11-10 10:33:14,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-11-10 10:33:14,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 737 transitions. [2018-11-10 10:33:14,637 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 737 transitions. Word has length 90 [2018-11-10 10:33:14,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:14,637 INFO L481 AbstractCegarLoop]: Abstraction has 492 states and 737 transitions. [2018-11-10 10:33:14,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:33:14,637 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 737 transitions. [2018-11-10 10:33:14,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-10 10:33:14,638 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:14,638 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, 1, 1] [2018-11-10 10:33:14,638 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:14,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:14,639 INFO L82 PathProgramCache]: Analyzing trace with hash -213685175, now seen corresponding path program 1 times [2018-11-10 10:33:14,639 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:33:14,639 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:33:14,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:15,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:33:15,025 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 10:33:15,026 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 10:33:15,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:15,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:15,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:15,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:33:15,036 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 10:33:15,038 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 10:33:15,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:15,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:15,039 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 10:33:15,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:33:15,047 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 10:33:15,047 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:33:15,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:15,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:33:15,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:33:15,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:33:15,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:33:15,050 INFO L87 Difference]: Start difference. First operand 492 states and 737 transitions. Second operand 4 states. [2018-11-10 10:33:17,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:17,610 INFO L93 Difference]: Finished difference Result 1073 states and 1598 transitions. [2018-11-10 10:33:17,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:33:17,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-11-10 10:33:17,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:17,612 INFO L225 Difference]: With dead ends: 1073 [2018-11-10 10:33:17,612 INFO L226 Difference]: Without dead ends: 607 [2018-11-10 10:33:17,613 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 10:33:17,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-11-10 10:33:17,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 492. [2018-11-10 10:33:17,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-11-10 10:33:17,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 735 transitions. [2018-11-10 10:33:17,630 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 735 transitions. Word has length 90 [2018-11-10 10:33:17,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:17,630 INFO L481 AbstractCegarLoop]: Abstraction has 492 states and 735 transitions. [2018-11-10 10:33:17,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:33:17,630 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 735 transitions. [2018-11-10 10:33:17,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-10 10:33:17,631 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:17,631 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, 1, 1] [2018-11-10 10:33:17,631 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:17,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:17,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1236628968, now seen corresponding path program 1 times [2018-11-10 10:33:17,631 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:33:17,631 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:33:17,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:18,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:33:18,043 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 10:33:18,045 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 10:33:18,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:18,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:18,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:18,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:33:18,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:33:18,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 10:33:18,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:18,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:18,066 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 10:33:18,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:33:18,075 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 10:33:18,075 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:33:18,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:18,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:33:18,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:33:18,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:33:18,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:33:18,079 INFO L87 Difference]: Start difference. First operand 492 states and 735 transitions. Second operand 4 states. [2018-11-10 10:33:20,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:20,630 INFO L93 Difference]: Finished difference Result 1073 states and 1594 transitions. [2018-11-10 10:33:20,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:33:20,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-11-10 10:33:20,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:20,632 INFO L225 Difference]: With dead ends: 1073 [2018-11-10 10:33:20,632 INFO L226 Difference]: Without dead ends: 607 [2018-11-10 10:33:20,632 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 10:33:20,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-11-10 10:33:20,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 492. [2018-11-10 10:33:20,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-11-10 10:33:20,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 733 transitions. [2018-11-10 10:33:20,650 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 733 transitions. Word has length 92 [2018-11-10 10:33:20,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:20,650 INFO L481 AbstractCegarLoop]: Abstraction has 492 states and 733 transitions. [2018-11-10 10:33:20,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:33:20,650 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 733 transitions. [2018-11-10 10:33:20,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-10 10:33:20,651 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:20,651 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, 1] [2018-11-10 10:33:20,651 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:20,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:20,651 INFO L82 PathProgramCache]: Analyzing trace with hash 2044871949, now seen corresponding path program 1 times [2018-11-10 10:33:20,651 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:33:20,651 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:33:20,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:21,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:33:21,334 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 10:33:21,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:33:21,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:21,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:21,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:21,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:33:21,354 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 10:33:21,357 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:33:21,358 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 10:33:21,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:21,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:21,371 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 10:33:21,371 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:33:21,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:33:21,376 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 10:33:21,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:21,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:21,378 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 10:33:21,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:33:21,390 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 10:33:21,390 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:33:21,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:21,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:33:21,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:33:21,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:33:21,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:33:21,394 INFO L87 Difference]: Start difference. First operand 492 states and 733 transitions. Second operand 7 states. [2018-11-10 10:33:24,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:24,420 INFO L93 Difference]: Finished difference Result 996 states and 1492 transitions. [2018-11-10 10:33:24,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:33:24,421 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-11-10 10:33:24,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:24,422 INFO L225 Difference]: With dead ends: 996 [2018-11-10 10:33:24,422 INFO L226 Difference]: Without dead ends: 743 [2018-11-10 10:33:24,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 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 10:33:24,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-11-10 10:33:24,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 574. [2018-11-10 10:33:24,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2018-11-10 10:33:24,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 877 transitions. [2018-11-10 10:33:24,443 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 877 transitions. Word has length 92 [2018-11-10 10:33:24,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:24,443 INFO L481 AbstractCegarLoop]: Abstraction has 574 states and 877 transitions. [2018-11-10 10:33:24,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:33:24,443 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 877 transitions. [2018-11-10 10:33:24,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-10 10:33:24,443 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:24,443 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, 1] [2018-11-10 10:33:24,444 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:24,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:24,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1147478671, now seen corresponding path program 1 times [2018-11-10 10:33:24,444 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:33:24,444 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:33:24,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:25,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:33:25,149 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 10:33:25,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 10:33:25,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:25,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:25,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:25,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:33:25,172 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 10:33:25,174 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:33:25,176 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 10:33:25,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:25,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:25,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 10:33:25,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:33:25,211 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 10:33:25,211 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:33:25,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:25,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:33:25,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:33:25,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:33:25,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:33:25,215 INFO L87 Difference]: Start difference. First operand 574 states and 877 transitions. Second operand 7 states. [2018-11-10 10:33:30,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:30,049 INFO L93 Difference]: Finished difference Result 1237 states and 1890 transitions. [2018-11-10 10:33:30,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:33:30,050 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-11-10 10:33:30,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:30,052 INFO L225 Difference]: With dead ends: 1237 [2018-11-10 10:33:30,052 INFO L226 Difference]: Without dead ends: 689 [2018-11-10 10:33:30,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 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 10:33:30,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2018-11-10 10:33:30,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 624. [2018-11-10 10:33:30,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2018-11-10 10:33:30,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 959 transitions. [2018-11-10 10:33:30,073 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 959 transitions. Word has length 92 [2018-11-10 10:33:30,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:30,073 INFO L481 AbstractCegarLoop]: Abstraction has 624 states and 959 transitions. [2018-11-10 10:33:30,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:33:30,073 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 959 transitions. [2018-11-10 10:33:30,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 10:33:30,074 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:30,074 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, 1, 1] [2018-11-10 10:33:30,074 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:30,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:30,074 INFO L82 PathProgramCache]: Analyzing trace with hash -382480148, now seen corresponding path program 1 times [2018-11-10 10:33:30,075 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:33:30,075 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:33:30,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:30,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:33:30,499 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 10:33:30,502 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 10:33:30,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:30,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:30,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:30,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:33:30,515 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 10:33:30,518 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 10:33:30,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:30,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:30,521 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 10:33:30,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:33:30,530 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 10:33:30,530 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:33:30,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:30,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:33:30,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:33:30,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:33:30,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:33:30,534 INFO L87 Difference]: Start difference. First operand 624 states and 959 transitions. Second operand 4 states. [2018-11-10 10:33:33,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:33,056 INFO L93 Difference]: Finished difference Result 1321 states and 2016 transitions. [2018-11-10 10:33:33,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:33:33,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-11-10 10:33:33,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:33,059 INFO L225 Difference]: With dead ends: 1321 [2018-11-10 10:33:33,059 INFO L226 Difference]: Without dead ends: 723 [2018-11-10 10:33:33,060 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 10:33:33,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2018-11-10 10:33:33,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 624. [2018-11-10 10:33:33,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2018-11-10 10:33:33,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 957 transitions. [2018-11-10 10:33:33,081 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 957 transitions. Word has length 93 [2018-11-10 10:33:33,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:33,081 INFO L481 AbstractCegarLoop]: Abstraction has 624 states and 957 transitions. [2018-11-10 10:33:33,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:33:33,082 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 957 transitions. [2018-11-10 10:33:33,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 10:33:33,082 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:33,083 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, 1, 1] [2018-11-10 10:33:33,083 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:33,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:33,083 INFO L82 PathProgramCache]: Analyzing trace with hash -4123332, now seen corresponding path program 1 times [2018-11-10 10:33:33,083 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:33:33,083 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:33:33,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:33,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:33:33,782 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 10:33:33,784 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 10:33:33,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:33,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:33,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:33,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:33:33,803 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 10:33:33,805 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:33:33,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 10:33:33,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:33,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:33,826 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 10:33:33,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:33:33,831 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 10:33:33,833 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 10:33:33,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:33,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:33,836 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 10:33:33,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:33:33,851 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 10:33:33,851 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:33:33,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:33,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:33:33,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:33:33,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:33:33,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:33:33,854 INFO L87 Difference]: Start difference. First operand 624 states and 957 transitions. Second operand 7 states. [2018-11-10 10:33:36,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:36,826 INFO L93 Difference]: Finished difference Result 1098 states and 1664 transitions. [2018-11-10 10:33:36,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:33:36,827 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-11-10 10:33:36,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:36,829 INFO L225 Difference]: With dead ends: 1098 [2018-11-10 10:33:36,829 INFO L226 Difference]: Without dead ends: 779 [2018-11-10 10:33:36,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 87 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 10:33:36,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-11-10 10:33:36,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 604. [2018-11-10 10:33:36,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-11-10 10:33:36,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 919 transitions. [2018-11-10 10:33:36,851 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 919 transitions. Word has length 93 [2018-11-10 10:33:36,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:36,851 INFO L481 AbstractCegarLoop]: Abstraction has 604 states and 919 transitions. [2018-11-10 10:33:36,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:33:36,851 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 919 transitions. [2018-11-10 10:33:36,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 10:33:36,852 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:36,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:33:36,852 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:36,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:36,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1882651096, now seen corresponding path program 1 times [2018-11-10 10:33:36,853 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:33:36,853 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:33:36,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:37,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:33:37,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 13 treesize of output 10 [2018-11-10 10:33:37,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 10 treesize of output 9 [2018-11-10 10:33:37,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:37,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:37,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:37,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:33:37,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 19 treesize of output 15 [2018-11-10 10:33:37,290 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 10:33:37,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:37,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:37,303 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 10:33:37,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:33:37,312 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 10:33:37,313 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:33:37,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:37,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:33:37,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:33:37,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:33:37,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:33:37,316 INFO L87 Difference]: Start difference. First operand 604 states and 919 transitions. Second operand 4 states. [2018-11-10 10:33:39,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:39,846 INFO L93 Difference]: Finished difference Result 1303 states and 1976 transitions. [2018-11-10 10:33:39,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:33:39,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-11-10 10:33:39,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:39,848 INFO L225 Difference]: With dead ends: 1303 [2018-11-10 10:33:39,848 INFO L226 Difference]: Without dead ends: 725 [2018-11-10 10:33:39,848 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 10:33:39,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-11-10 10:33:39,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 606. [2018-11-10 10:33:39,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-11-10 10:33:39,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 921 transitions. [2018-11-10 10:33:39,870 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 921 transitions. Word has length 94 [2018-11-10 10:33:39,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:39,870 INFO L481 AbstractCegarLoop]: Abstraction has 606 states and 921 transitions. [2018-11-10 10:33:39,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:33:39,870 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 921 transitions. [2018-11-10 10:33:39,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-10 10:33:39,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:39,871 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, 1, 1] [2018-11-10 10:33:39,871 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:39,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:39,871 INFO L82 PathProgramCache]: Analyzing trace with hash -527844273, now seen corresponding path program 1 times [2018-11-10 10:33:39,872 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:33:39,872 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:33:39,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:40,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:33:40,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 10:33:40,297 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 10:33:40,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:40,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:40,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:40,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:33:40,308 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 10:33:40,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 10:33:40,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:40,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:40,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 10:33:40,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:33:40,329 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 10:33:40,329 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:33:40,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:40,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:33:40,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:33:40,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:33:40,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:33:40,332 INFO L87 Difference]: Start difference. First operand 606 states and 921 transitions. Second operand 4 states. [2018-11-10 10:33:42,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:42,850 INFO L93 Difference]: Finished difference Result 1285 states and 1952 transitions. [2018-11-10 10:33:42,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:33:42,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-11-10 10:33:42,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:42,853 INFO L225 Difference]: With dead ends: 1285 [2018-11-10 10:33:42,853 INFO L226 Difference]: Without dead ends: 705 [2018-11-10 10:33:42,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 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 10:33:42,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2018-11-10 10:33:42,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 606. [2018-11-10 10:33:42,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-11-10 10:33:42,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 919 transitions. [2018-11-10 10:33:42,876 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 919 transitions. Word has length 95 [2018-11-10 10:33:42,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:42,876 INFO L481 AbstractCegarLoop]: Abstraction has 606 states and 919 transitions. [2018-11-10 10:33:42,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:33:42,876 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 919 transitions. [2018-11-10 10:33:42,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-10 10:33:42,877 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:42,877 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, 1, 1] [2018-11-10 10:33:42,877 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:42,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:42,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1921075204, now seen corresponding path program 1 times [2018-11-10 10:33:42,878 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:33:42,878 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:33:42,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:43,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:33:43,295 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 10:33:43,296 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 10:33:43,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:43,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:43,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:43,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:33:43,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 10:33:43,308 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 10:33:43,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:43,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:43,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 10:33:43,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:33:43,321 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 10:33:43,321 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:33:43,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:43,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:33:43,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:33:43,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:33:43,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:33:43,325 INFO L87 Difference]: Start difference. First operand 606 states and 919 transitions. Second operand 4 states. [2018-11-10 10:33:45,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:45,820 INFO L93 Difference]: Finished difference Result 1285 states and 1948 transitions. [2018-11-10 10:33:45,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:33:45,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-11-10 10:33:45,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:45,822 INFO L225 Difference]: With dead ends: 1285 [2018-11-10 10:33:45,822 INFO L226 Difference]: Without dead ends: 705 [2018-11-10 10:33:45,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 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 10:33:45,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2018-11-10 10:33:45,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 606. [2018-11-10 10:33:45,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-11-10 10:33:45,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 917 transitions. [2018-11-10 10:33:45,844 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 917 transitions. Word has length 95 [2018-11-10 10:33:45,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:45,845 INFO L481 AbstractCegarLoop]: Abstraction has 606 states and 917 transitions. [2018-11-10 10:33:45,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:33:45,845 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 917 transitions. [2018-11-10 10:33:45,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-10 10:33:45,845 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:45,845 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, 1, 1] [2018-11-10 10:33:45,845 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:45,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:45,845 INFO L82 PathProgramCache]: Analyzing trace with hash 484346764, now seen corresponding path program 1 times [2018-11-10 10:33:45,846 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:33:45,846 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:33:45,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:46,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:33:46,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 13 treesize of output 10 [2018-11-10 10:33:46,266 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 10:33:46,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:46,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:46,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:46,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:33:46,282 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 10:33:46,283 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 10:33:46,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:46,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:46,292 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 10:33:46,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:33:46,300 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 10:33:46,301 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:33:46,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:46,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:33:46,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:33:46,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:33:46,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:33:46,304 INFO L87 Difference]: Start difference. First operand 606 states and 917 transitions. Second operand 4 states. [2018-11-10 10:33:48,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:48,790 INFO L93 Difference]: Finished difference Result 1281 states and 1940 transitions. [2018-11-10 10:33:48,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:33:48,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-11-10 10:33:48,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:48,792 INFO L225 Difference]: With dead ends: 1281 [2018-11-10 10:33:48,792 INFO L226 Difference]: Without dead ends: 701 [2018-11-10 10:33:48,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 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 10:33:48,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-11-10 10:33:48,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 608. [2018-11-10 10:33:48,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-11-10 10:33:48,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 919 transitions. [2018-11-10 10:33:48,815 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 919 transitions. Word has length 95 [2018-11-10 10:33:48,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:48,815 INFO L481 AbstractCegarLoop]: Abstraction has 608 states and 919 transitions. [2018-11-10 10:33:48,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:33:48,815 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 919 transitions. [2018-11-10 10:33:48,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-10 10:33:48,816 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:48,816 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, 1, 1] [2018-11-10 10:33:48,816 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:48,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:48,816 INFO L82 PathProgramCache]: Analyzing trace with hash 2001401312, now seen corresponding path program 1 times [2018-11-10 10:33:48,816 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:33:48,816 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:33:48,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:49,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:33:49,236 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 10:33:49,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 10:33:49,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:49,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:49,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:49,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:33:49,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:33:49,250 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 10:33:49,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:49,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:49,253 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 10:33:49,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:33:49,262 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 10:33:49,262 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:33:49,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:49,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:33:49,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:33:49,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:33:49,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:33:49,265 INFO L87 Difference]: Start difference. First operand 608 states and 919 transitions. Second operand 4 states. [2018-11-10 10:33:51,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:51,733 INFO L93 Difference]: Finished difference Result 1279 states and 1934 transitions. [2018-11-10 10:33:51,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:33:51,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-11-10 10:33:51,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:51,735 INFO L225 Difference]: With dead ends: 1279 [2018-11-10 10:33:51,736 INFO L226 Difference]: Without dead ends: 697 [2018-11-10 10:33:51,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 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 10:33:51,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2018-11-10 10:33:51,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 608. [2018-11-10 10:33:51,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-11-10 10:33:51,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 917 transitions. [2018-11-10 10:33:51,770 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 917 transitions. Word has length 96 [2018-11-10 10:33:51,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:51,770 INFO L481 AbstractCegarLoop]: Abstraction has 608 states and 917 transitions. [2018-11-10 10:33:51,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:33:51,770 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 917 transitions. [2018-11-10 10:33:51,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-10 10:33:51,771 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:51,771 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, 1, 1] [2018-11-10 10:33:51,771 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:51,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:51,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1252892634, now seen corresponding path program 1 times [2018-11-10 10:33:51,772 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:33:51,772 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:33:51,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:52,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:33:52,195 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 10:33:52,197 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 10:33:52,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:52,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:52,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:52,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:33:52,209 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 10:33:52,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:33:52,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:52,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:52,216 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 10:33:52,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:33:52,224 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 10:33:52,224 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:33:52,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:52,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:33:52,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:33:52,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:33:52,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:33:52,227 INFO L87 Difference]: Start difference. First operand 608 states and 917 transitions. Second operand 4 states. [2018-11-10 10:33:54,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:54,694 INFO L93 Difference]: Finished difference Result 1273 states and 1922 transitions. [2018-11-10 10:33:54,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:33:54,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-11-10 10:33:54,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:54,695 INFO L225 Difference]: With dead ends: 1273 [2018-11-10 10:33:54,695 INFO L226 Difference]: Without dead ends: 691 [2018-11-10 10:33:54,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 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 10:33:54,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2018-11-10 10:33:54,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 610. [2018-11-10 10:33:54,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-11-10 10:33:54,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 919 transitions. [2018-11-10 10:33:54,724 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 919 transitions. Word has length 96 [2018-11-10 10:33:54,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:54,724 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 919 transitions. [2018-11-10 10:33:54,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:33:54,724 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 919 transitions. [2018-11-10 10:33:54,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-10 10:33:54,725 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:54,725 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, 1, 1] [2018-11-10 10:33:54,725 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:54,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:54,725 INFO L82 PathProgramCache]: Analyzing trace with hash 99074589, now seen corresponding path program 1 times [2018-11-10 10:33:54,725 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:33:54,725 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:33:54,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:55,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:33:55,599 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 10:33:55,601 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 10:33:55,604 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:33:55,605 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 10:33:55,605 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:55,611 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:55,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:55,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 10:33:55,622 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:33:55,631 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 10:33:55,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 10:33:55,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:55,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:55,636 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 10:33:55,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:33:55,647 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 10:33:55,647 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:33:55,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:55,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:33:55,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:33:55,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:33:55,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:33:55,651 INFO L87 Difference]: Start difference. First operand 610 states and 919 transitions. Second operand 7 states. [2018-11-10 10:33:58,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:58,365 INFO L93 Difference]: Finished difference Result 925 states and 1405 transitions. [2018-11-10 10:33:58,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:33:58,365 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-11-10 10:33:58,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:58,367 INFO L225 Difference]: With dead ends: 925 [2018-11-10 10:33:58,367 INFO L226 Difference]: Without dead ends: 618 [2018-11-10 10:33:58,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 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 10:33:58,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-11-10 10:33:58,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 610. [2018-11-10 10:33:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-11-10 10:33:58,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 918 transitions. [2018-11-10 10:33:58,391 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 918 transitions. Word has length 98 [2018-11-10 10:33:58,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:58,391 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 918 transitions. [2018-11-10 10:33:58,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:33:58,392 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 918 transitions. [2018-11-10 10:33:58,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-10 10:33:58,392 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:58,392 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, 1, 1] [2018-11-10 10:33:58,393 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:58,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:58,393 INFO L82 PathProgramCache]: Analyzing trace with hash 777839524, now seen corresponding path program 1 times [2018-11-10 10:33:58,393 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:33:58,393 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:33:58,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:58,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:33:58,804 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 10:33:58,805 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 10:33:58,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:58,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:58,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:58,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:33:58,817 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 10:33:58,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 10:33:58,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:58,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:58,821 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 10:33:58,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:33:58,833 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 10:33:58,833 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:33:58,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:58,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:33:58,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:33:58,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:33:58,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:33:58,837 INFO L87 Difference]: Start difference. First operand 610 states and 918 transitions. Second operand 4 states. [2018-11-10 10:34:01,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:01,292 INFO L93 Difference]: Finished difference Result 1275 states and 1920 transitions. [2018-11-10 10:34:01,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:34:01,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-11-10 10:34:01,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:01,294 INFO L225 Difference]: With dead ends: 1275 [2018-11-10 10:34:01,294 INFO L226 Difference]: Without dead ends: 691 [2018-11-10 10:34:01,295 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 10:34:01,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2018-11-10 10:34:01,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 612. [2018-11-10 10:34:01,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-11-10 10:34:01,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 920 transitions. [2018-11-10 10:34:01,319 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 920 transitions. Word has length 99 [2018-11-10 10:34:01,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:01,319 INFO L481 AbstractCegarLoop]: Abstraction has 612 states and 920 transitions. [2018-11-10 10:34:01,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:34:01,319 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 920 transitions. [2018-11-10 10:34:01,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 10:34:01,320 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:01,320 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, 1, 1] [2018-11-10 10:34:01,320 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:01,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:01,321 INFO L82 PathProgramCache]: Analyzing trace with hash 826591611, now seen corresponding path program 1 times [2018-11-10 10:34:01,321 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:34:01,321 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:34:01,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:01,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:34:01,746 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 10:34:01,748 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 10:34:01,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:01,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:01,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:01,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:34:01,759 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 10:34:01,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 10:34:01,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:01,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:01,762 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 10:34:01,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:34:01,773 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 10:34:01,773 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:34:01,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:01,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:34:01,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:34:01,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:34:01,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:34:01,777 INFO L87 Difference]: Start difference. First operand 612 states and 920 transitions. Second operand 4 states. [2018-11-10 10:34:04,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:04,237 INFO L93 Difference]: Finished difference Result 1265 states and 1904 transitions. [2018-11-10 10:34:04,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:34:04,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-11-10 10:34:04,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:04,239 INFO L225 Difference]: With dead ends: 1265 [2018-11-10 10:34:04,239 INFO L226 Difference]: Without dead ends: 679 [2018-11-10 10:34:04,240 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 10:34:04,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2018-11-10 10:34:04,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 614. [2018-11-10 10:34:04,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-11-10 10:34:04,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 922 transitions. [2018-11-10 10:34:04,263 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 922 transitions. Word has length 100 [2018-11-10 10:34:04,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:04,263 INFO L481 AbstractCegarLoop]: Abstraction has 614 states and 922 transitions. [2018-11-10 10:34:04,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:34:04,263 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 922 transitions. [2018-11-10 10:34:04,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 10:34:04,264 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:04,264 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, 1, 1] [2018-11-10 10:34:04,264 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:04,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:04,264 INFO L82 PathProgramCache]: Analyzing trace with hash 777786042, now seen corresponding path program 1 times [2018-11-10 10:34:04,265 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:34:04,265 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:34:04,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:04,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:34:04,675 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 10:34:04,677 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 10:34:04,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:04,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:04,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:04,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:34:04,690 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 10:34:04,692 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 10:34:04,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:04,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:04,695 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 10:34:04,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:34:04,705 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 10:34:04,705 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:34:04,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:04,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:34:04,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:34:04,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:34:04,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:34:04,708 INFO L87 Difference]: Start difference. First operand 614 states and 922 transitions. Second operand 4 states. [2018-11-10 10:34:07,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:07,157 INFO L93 Difference]: Finished difference Result 1267 states and 1904 transitions. [2018-11-10 10:34:07,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:34:07,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-11-10 10:34:07,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:07,159 INFO L225 Difference]: With dead ends: 1267 [2018-11-10 10:34:07,159 INFO L226 Difference]: Without dead ends: 679 [2018-11-10 10:34:07,160 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 10:34:07,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2018-11-10 10:34:07,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 616. [2018-11-10 10:34:07,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-11-10 10:34:07,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 924 transitions. [2018-11-10 10:34:07,203 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 924 transitions. Word has length 100 [2018-11-10 10:34:07,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:07,203 INFO L481 AbstractCegarLoop]: Abstraction has 616 states and 924 transitions. [2018-11-10 10:34:07,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:34:07,203 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 924 transitions. [2018-11-10 10:34:07,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-10 10:34:07,204 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:07,204 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, 1, 1] [2018-11-10 10:34:07,204 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:07,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:07,205 INFO L82 PathProgramCache]: Analyzing trace with hash 753563747, now seen corresponding path program 1 times [2018-11-10 10:34:07,205 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:34:07,205 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:34:07,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:07,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:34:07,771 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 10:34:07,773 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 10:34:07,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:07,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:07,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:07,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:34:07,784 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 10:34:07,786 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 10:34:07,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:07,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:07,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 10:34:07,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:34:07,799 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 10:34:07,799 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:34:07,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:07,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:34:07,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:34:07,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:34:07,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:34:07,803 INFO L87 Difference]: Start difference. First operand 616 states and 924 transitions. Second operand 4 states. [2018-11-10 10:34:10,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:10,255 INFO L93 Difference]: Finished difference Result 1263 states and 1897 transitions. [2018-11-10 10:34:10,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:34:10,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-11-10 10:34:10,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:10,257 INFO L225 Difference]: With dead ends: 1263 [2018-11-10 10:34:10,257 INFO L226 Difference]: Without dead ends: 673 [2018-11-10 10:34:10,258 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 10:34:10,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-11-10 10:34:10,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 618. [2018-11-10 10:34:10,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-11-10 10:34:10,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 926 transitions. [2018-11-10 10:34:10,286 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 926 transitions. Word has length 101 [2018-11-10 10:34:10,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:10,286 INFO L481 AbstractCegarLoop]: Abstraction has 618 states and 926 transitions. [2018-11-10 10:34:10,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:34:10,286 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 926 transitions. [2018-11-10 10:34:10,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 10:34:10,287 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:10,287 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, 1, 1] [2018-11-10 10:34:10,288 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:10,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:10,288 INFO L82 PathProgramCache]: Analyzing trace with hash -272351086, now seen corresponding path program 1 times [2018-11-10 10:34:10,288 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:34:10,288 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:34:10,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:10,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:34:10,715 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 10:34:10,717 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 10:34:10,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:10,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:10,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:10,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:34:10,731 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 10:34:10,733 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 10:34:10,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:10,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:10,735 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 10:34:10,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:34:10,744 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 10:34:10,744 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:34:10,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:10,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:34:10,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:34:10,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:34:10,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:34:10,748 INFO L87 Difference]: Start difference. First operand 618 states and 926 transitions. Second operand 4 states. [2018-11-10 10:34:13,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:13,234 INFO L93 Difference]: Finished difference Result 1265 states and 1897 transitions. [2018-11-10 10:34:13,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:34:13,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-11-10 10:34:13,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:13,236 INFO L225 Difference]: With dead ends: 1265 [2018-11-10 10:34:13,236 INFO L226 Difference]: Without dead ends: 673 [2018-11-10 10:34:13,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 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 10:34:13,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-11-10 10:34:13,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 620. [2018-11-10 10:34:13,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-11-10 10:34:13,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 928 transitions. [2018-11-10 10:34:13,261 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 928 transitions. Word has length 102 [2018-11-10 10:34:13,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:13,262 INFO L481 AbstractCegarLoop]: Abstraction has 620 states and 928 transitions. [2018-11-10 10:34:13,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:34:13,262 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 928 transitions. [2018-11-10 10:34:13,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-10 10:34:13,263 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:13,263 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, 1, 1] [2018-11-10 10:34:13,263 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:13,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:13,263 INFO L82 PathProgramCache]: Analyzing trace with hash 684290203, now seen corresponding path program 1 times [2018-11-10 10:34:13,264 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:34:13,264 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:34:13,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:13,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:34:13,699 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 10:34:13,703 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 10:34:13,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:13,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:13,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:13,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:34:13,717 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 10:34:13,719 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 10:34:13,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:13,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:13,728 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 10:34:13,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:34:13,738 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 10:34:13,738 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:34:13,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:13,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:34:13,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:34:13,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:34:13,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:34:13,741 INFO L87 Difference]: Start difference. First operand 620 states and 928 transitions. Second operand 4 states. [2018-11-10 10:34:16,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:16,188 INFO L93 Difference]: Finished difference Result 1261 states and 1890 transitions. [2018-11-10 10:34:16,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:34:16,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-11-10 10:34:16,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:16,190 INFO L225 Difference]: With dead ends: 1261 [2018-11-10 10:34:16,190 INFO L226 Difference]: Without dead ends: 667 [2018-11-10 10:34:16,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 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 10:34:16,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-11-10 10:34:16,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 622. [2018-11-10 10:34:16,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-11-10 10:34:16,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 930 transitions. [2018-11-10 10:34:16,215 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 930 transitions. Word has length 103 [2018-11-10 10:34:16,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:16,215 INFO L481 AbstractCegarLoop]: Abstraction has 622 states and 930 transitions. [2018-11-10 10:34:16,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:34:16,215 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 930 transitions. [2018-11-10 10:34:16,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 10:34:16,216 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:16,216 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, 1, 1] [2018-11-10 10:34:16,216 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:16,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:16,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1978832885, now seen corresponding path program 1 times [2018-11-10 10:34:16,216 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:34:16,216 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:34:16,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:17,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:34:17,108 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 10:34:17,110 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 10:34:17,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:17,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:17,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:17,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:34:17,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 23 treesize of output 18 [2018-11-10 10:34:17,136 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:34:17,138 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 10:34:17,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:17,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:17,152 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 10:34:17,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:34:17,154 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 10:34:17,159 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 10:34:17,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:17,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:17,163 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 10:34:17,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:34:17,175 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 10:34:17,175 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:34:17,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:17,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:34:17,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:34:17,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:34:17,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:34:17,179 INFO L87 Difference]: Start difference. First operand 622 states and 930 transitions. Second operand 7 states. [2018-11-10 10:34:18,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:18,046 INFO L93 Difference]: Finished difference Result 1375 states and 2038 transitions. [2018-11-10 10:34:18,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:34:18,047 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 108 [2018-11-10 10:34:18,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:18,048 INFO L225 Difference]: With dead ends: 1375 [2018-11-10 10:34:18,048 INFO L226 Difference]: Without dead ends: 779 [2018-11-10 10:34:18,049 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 10:34:18,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-11-10 10:34:18,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 622. [2018-11-10 10:34:18,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-11-10 10:34:18,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 928 transitions. [2018-11-10 10:34:18,074 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 928 transitions. Word has length 108 [2018-11-10 10:34:18,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:18,074 INFO L481 AbstractCegarLoop]: Abstraction has 622 states and 928 transitions. [2018-11-10 10:34:18,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:34:18,074 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 928 transitions. [2018-11-10 10:34:18,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 10:34:18,074 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:18,075 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, 1, 1] [2018-11-10 10:34:18,075 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:18,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:18,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1755434633, now seen corresponding path program 1 times [2018-11-10 10:34:18,075 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:34:18,075 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:34:18,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:18,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:34:18,988 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 10:34:18,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:34:18,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:18,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:18,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:18,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:34:19,010 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 10:34:19,012 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:34:19,014 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 10:34:19,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:19,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:19,027 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 10:34:19,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:34:19,029 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 10:34:19,030 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 10:34:19,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:19,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:19,034 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 10:34:19,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:34:19,057 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 10:34:19,058 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:34:19,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:19,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:34:19,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:34:19,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:34:19,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:34:19,062 INFO L87 Difference]: Start difference. First operand 622 states and 928 transitions. Second operand 7 states. [2018-11-10 10:34:21,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:21,864 INFO L93 Difference]: Finished difference Result 1283 states and 1908 transitions. [2018-11-10 10:34:21,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:34:21,864 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 108 [2018-11-10 10:34:21,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:21,866 INFO L225 Difference]: With dead ends: 1283 [2018-11-10 10:34:21,866 INFO L226 Difference]: Without dead ends: 687 [2018-11-10 10:34:21,867 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 10:34:21,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-11-10 10:34:21,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 622. [2018-11-10 10:34:21,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-11-10 10:34:21,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 926 transitions. [2018-11-10 10:34:21,893 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 926 transitions. Word has length 108 [2018-11-10 10:34:21,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:21,893 INFO L481 AbstractCegarLoop]: Abstraction has 622 states and 926 transitions. [2018-11-10 10:34:21,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:34:21,893 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 926 transitions. [2018-11-10 10:34:21,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 10:34:21,893 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:21,893 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, 1, 1] [2018-11-10 10:34:21,894 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:21,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:21,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1932711937, now seen corresponding path program 1 times [2018-11-10 10:34:21,894 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:34:21,894 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:34:21,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:22,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:34:22,795 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 10:34:22,796 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 10:34:22,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:22,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:22,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:22,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:34:22,816 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 10:34:22,818 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:34:22,819 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 10:34:22,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:22,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:22,832 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 10:34:22,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:34:22,836 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 10:34:22,837 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 10:34:22,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:22,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:22,844 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 10:34:22,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:34:22,857 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 10:34:22,857 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:34:22,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:22,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:34:22,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:34:22,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:34:22,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:34:22,861 INFO L87 Difference]: Start difference. First operand 622 states and 926 transitions. Second operand 7 states. [2018-11-10 10:34:25,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:25,754 INFO L93 Difference]: Finished difference Result 1375 states and 2030 transitions. [2018-11-10 10:34:25,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:34:25,754 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-11-10 10:34:25,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:25,756 INFO L225 Difference]: With dead ends: 1375 [2018-11-10 10:34:25,756 INFO L226 Difference]: Without dead ends: 779 [2018-11-10 10:34:25,756 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 10:34:25,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-11-10 10:34:25,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 622. [2018-11-10 10:34:25,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-11-10 10:34:25,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 924 transitions. [2018-11-10 10:34:25,782 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 924 transitions. Word has length 109 [2018-11-10 10:34:25,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:25,782 INFO L481 AbstractCegarLoop]: Abstraction has 622 states and 924 transitions. [2018-11-10 10:34:25,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:34:25,783 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 924 transitions. [2018-11-10 10:34:25,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 10:34:25,783 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:25,783 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, 1, 1] [2018-11-10 10:34:25,784 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:25,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:25,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1730888003, now seen corresponding path program 1 times [2018-11-10 10:34:25,784 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:34:25,784 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:34:25,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:26,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:34:26,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 13 treesize of output 10 [2018-11-10 10:34:26,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:34:26,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:26,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:26,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:26,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:34:26,724 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 10:34:26,726 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:34:26,728 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 10:34:26,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:26,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:26,740 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 10:34:26,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:34:26,742 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 10:34:26,743 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 10:34:26,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:26,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:26,747 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 10:34:26,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:34:26,760 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 10:34:26,760 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:34:26,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:26,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:34:26,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:34:26,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:34:26,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:34:26,764 INFO L87 Difference]: Start difference. First operand 622 states and 924 transitions. Second operand 7 states. [2018-11-10 10:34:27,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:27,575 INFO L93 Difference]: Finished difference Result 1283 states and 1900 transitions. [2018-11-10 10:34:27,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:34:27,575 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-11-10 10:34:27,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:27,577 INFO L225 Difference]: With dead ends: 1283 [2018-11-10 10:34:27,577 INFO L226 Difference]: Without dead ends: 687 [2018-11-10 10:34:27,578 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 10:34:27,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-11-10 10:34:27,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 622. [2018-11-10 10:34:27,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-11-10 10:34:27,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 922 transitions. [2018-11-10 10:34:27,605 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 922 transitions. Word has length 109 [2018-11-10 10:34:27,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:27,605 INFO L481 AbstractCegarLoop]: Abstraction has 622 states and 922 transitions. [2018-11-10 10:34:27,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:34:27,605 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 922 transitions. [2018-11-10 10:34:27,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 10:34:27,605 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:27,605 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, 1, 1] [2018-11-10 10:34:27,605 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:27,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:27,606 INFO L82 PathProgramCache]: Analyzing trace with hash 160749520, now seen corresponding path program 1 times [2018-11-10 10:34:27,606 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:34:27,606 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:34:27,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:28,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:34:28,515 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 10:34:28,516 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 10:34:28,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:28,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:28,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:28,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:34:28,542 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 10:34:28,545 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:34:28,546 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 10:34:28,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:28,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:28,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 10:34:28,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:34:28,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 10:34:28,562 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 10:34:28,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:28,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:28,566 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 10:34:28,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:34:28,579 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 10:34:28,579 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:34:28,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:28,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:34:28,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:34:28,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:34:28,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:34:28,583 INFO L87 Difference]: Start difference. First operand 622 states and 922 transitions. Second operand 7 states. [2018-11-10 10:34:31,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:31,493 INFO L93 Difference]: Finished difference Result 1375 states and 2022 transitions. [2018-11-10 10:34:31,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:34:31,494 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 110 [2018-11-10 10:34:31,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:31,496 INFO L225 Difference]: With dead ends: 1375 [2018-11-10 10:34:31,496 INFO L226 Difference]: Without dead ends: 779 [2018-11-10 10:34:31,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 104 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 10:34:31,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-11-10 10:34:31,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 622. [2018-11-10 10:34:31,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-11-10 10:34:31,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 920 transitions. [2018-11-10 10:34:31,525 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 920 transitions. Word has length 110 [2018-11-10 10:34:31,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:31,525 INFO L481 AbstractCegarLoop]: Abstraction has 622 states and 920 transitions. [2018-11-10 10:34:31,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:34:31,526 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 920 transitions. [2018-11-10 10:34:31,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 10:34:31,526 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:31,526 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, 1, 1] [2018-11-10 10:34:31,527 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:31,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:31,527 INFO L82 PathProgramCache]: Analyzing trace with hash 2122324178, now seen corresponding path program 1 times [2018-11-10 10:34:31,527 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:34:31,527 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:34:31,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:32,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:34:32,471 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 10:34:32,473 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 10:34:32,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:32,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:32,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:32,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:34:32,492 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 10:34:32,494 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:34:32,495 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 10:34:32,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:32,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:32,508 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 10:34:32,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:34:32,511 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 10:34:32,512 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 10:34:32,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:32,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:32,516 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 10:34:32,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:34:32,529 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 10:34:32,529 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:34:32,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:32,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:34:32,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:34:32,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:34:32,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:34:32,534 INFO L87 Difference]: Start difference. First operand 622 states and 920 transitions. Second operand 7 states. [2018-11-10 10:34:35,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:35,326 INFO L93 Difference]: Finished difference Result 1283 states and 1892 transitions. [2018-11-10 10:34:35,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:34:35,327 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 110 [2018-11-10 10:34:35,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:35,328 INFO L225 Difference]: With dead ends: 1283 [2018-11-10 10:34:35,328 INFO L226 Difference]: Without dead ends: 687 [2018-11-10 10:34:35,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 104 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 10:34:35,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-11-10 10:34:35,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 622. [2018-11-10 10:34:35,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-11-10 10:34:35,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 918 transitions. [2018-11-10 10:34:35,364 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 918 transitions. Word has length 110 [2018-11-10 10:34:35,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:35,364 INFO L481 AbstractCegarLoop]: Abstraction has 622 states and 918 transitions. [2018-11-10 10:34:35,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:34:35,364 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 918 transitions. [2018-11-10 10:34:35,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-10 10:34:35,365 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:35,365 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, 1] [2018-11-10 10:34:35,365 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:35,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:35,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1382764740, now seen corresponding path program 1 times [2018-11-10 10:34:35,366 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:34:35,366 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:34:35,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:35,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:34:35,836 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 10:34:35,838 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 10:34:35,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:35,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:35,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:35,845 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:34:35,853 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 10:34:35,855 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 10:34:35,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:35,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:35,859 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 10:34:35,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:34:35,871 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 10:34:35,871 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:34:35,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:35,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:34:35,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:34:35,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:34:35,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:34:35,874 INFO L87 Difference]: Start difference. First operand 622 states and 918 transitions. Second operand 4 states. [2018-11-10 10:34:38,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:38,320 INFO L93 Difference]: Finished difference Result 1263 states and 1866 transitions. [2018-11-10 10:34:38,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:34:38,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2018-11-10 10:34:38,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:38,322 INFO L225 Difference]: With dead ends: 1263 [2018-11-10 10:34:38,322 INFO L226 Difference]: Without dead ends: 667 [2018-11-10 10:34:38,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 108 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 10:34:38,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-11-10 10:34:38,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 628. [2018-11-10 10:34:38,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-11-10 10:34:38,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 924 transitions. [2018-11-10 10:34:38,359 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 924 transitions. Word has length 111 [2018-11-10 10:34:38,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:38,359 INFO L481 AbstractCegarLoop]: Abstraction has 628 states and 924 transitions. [2018-11-10 10:34:38,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:34:38,359 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 924 transitions. [2018-11-10 10:34:38,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-10 10:34:38,359 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:38,360 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, 1, 1] [2018-11-10 10:34:38,360 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:38,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:38,360 INFO L82 PathProgramCache]: Analyzing trace with hash -569155398, now seen corresponding path program 1 times [2018-11-10 10:34:38,360 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:34:38,360 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:34:38,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:39,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:34:39,285 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 10:34:39,287 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 10:34:39,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:39,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:39,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:39,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:34:39,306 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 10:34:39,308 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:34:39,310 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 10:34:39,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:39,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:39,323 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 10:34:39,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:34:39,326 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 10:34:39,327 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 10:34:39,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:39,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:39,331 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 10:34:39,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:34:39,344 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 10:34:39,344 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:34:39,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:39,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:34:39,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:34:39,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:34:39,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:34:39,349 INFO L87 Difference]: Start difference. First operand 628 states and 924 transitions. Second operand 7 states. [2018-11-10 10:34:42,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:42,261 INFO L93 Difference]: Finished difference Result 1363 states and 1996 transitions. [2018-11-10 10:34:42,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:34:42,262 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-11-10 10:34:42,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:42,263 INFO L225 Difference]: With dead ends: 1363 [2018-11-10 10:34:42,263 INFO L226 Difference]: Without dead ends: 761 [2018-11-10 10:34:42,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 105 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 10:34:42,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2018-11-10 10:34:42,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 628. [2018-11-10 10:34:42,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-11-10 10:34:42,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 922 transitions. [2018-11-10 10:34:42,291 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 922 transitions. Word has length 111 [2018-11-10 10:34:42,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:42,292 INFO L481 AbstractCegarLoop]: Abstraction has 628 states and 922 transitions. [2018-11-10 10:34:42,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:34:42,292 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 922 transitions. [2018-11-10 10:34:42,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-10 10:34:42,292 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:42,292 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, 1, 1] [2018-11-10 10:34:42,292 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:42,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:42,293 INFO L82 PathProgramCache]: Analyzing trace with hash 110116856, now seen corresponding path program 1 times [2018-11-10 10:34:42,293 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:34:42,293 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:34:42,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:43,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:34:43,223 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 10:34:43,224 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 10:34:43,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:43,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:43,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:43,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:34:43,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 23 treesize of output 18 [2018-11-10 10:34:43,249 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:34:43,250 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 10:34:43,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:43,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:43,263 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 10:34:43,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:34:43,265 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 10:34:43,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:34:43,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:43,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:43,270 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 10:34:43,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:34:43,292 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 10:34:43,292 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:34:43,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:43,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:34:43,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:34:43,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:34:43,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:34:43,296 INFO L87 Difference]: Start difference. First operand 628 states and 922 transitions. Second operand 7 states. [2018-11-10 10:34:44,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:44,121 INFO L93 Difference]: Finished difference Result 1275 states and 1870 transitions. [2018-11-10 10:34:44,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:34:44,122 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-11-10 10:34:44,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:44,123 INFO L225 Difference]: With dead ends: 1275 [2018-11-10 10:34:44,123 INFO L226 Difference]: Without dead ends: 673 [2018-11-10 10:34:44,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 105 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 10:34:44,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-11-10 10:34:44,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 628. [2018-11-10 10:34:44,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-11-10 10:34:44,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 920 transitions. [2018-11-10 10:34:44,153 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 920 transitions. Word has length 111 [2018-11-10 10:34:44,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:44,153 INFO L481 AbstractCegarLoop]: Abstraction has 628 states and 920 transitions. [2018-11-10 10:34:44,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:34:44,153 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 920 transitions. [2018-11-10 10:34:44,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 10:34:44,154 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:44,154 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, 1, 1] [2018-11-10 10:34:44,154 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:44,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:44,154 INFO L82 PathProgramCache]: Analyzing trace with hash 2084137371, now seen corresponding path program 1 times [2018-11-10 10:34:44,155 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:34:44,155 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:34:44,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:44,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:34:44,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 13 treesize of output 10 [2018-11-10 10:34:44,644 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 10:34:44,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:44,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:44,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:44,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:34:44,655 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 10:34:44,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 10:34:44,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:44,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:44,659 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 10:34:44,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:34:44,674 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 10:34:44,675 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:34:44,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:44,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:34:44,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:34:44,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:34:44,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:34:44,678 INFO L87 Difference]: Start difference. First operand 628 states and 920 transitions. Second operand 4 states. [2018-11-10 10:34:47,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:47,108 INFO L93 Difference]: Finished difference Result 1255 states and 1844 transitions. [2018-11-10 10:34:47,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:34:47,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2018-11-10 10:34:47,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:47,109 INFO L225 Difference]: With dead ends: 1255 [2018-11-10 10:34:47,109 INFO L226 Difference]: Without dead ends: 653 [2018-11-10 10:34:47,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 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 10:34:47,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-11-10 10:34:47,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 630. [2018-11-10 10:34:47,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2018-11-10 10:34:47,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 922 transitions. [2018-11-10 10:34:47,140 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 922 transitions. Word has length 112 [2018-11-10 10:34:47,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:47,141 INFO L481 AbstractCegarLoop]: Abstraction has 630 states and 922 transitions. [2018-11-10 10:34:47,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:34:47,141 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 922 transitions. [2018-11-10 10:34:47,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 10:34:47,142 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:47,142 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, 1, 1, 1] [2018-11-10 10:34:47,142 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:47,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:47,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1530199105, now seen corresponding path program 1 times [2018-11-10 10:34:47,143 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:34:47,143 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:34:47,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:47,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:34:47,633 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 10:34:47,634 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 10:34:47,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:47,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:47,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:47,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:34:47,645 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 10:34:47,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 15 treesize of output 3 [2018-11-10 10:34:47,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:47,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:47,649 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 10:34:47,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:34:47,660 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 10:34:47,660 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:34:47,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:47,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:34:47,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:34:47,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:34:47,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:34:47,664 INFO L87 Difference]: Start difference. First operand 630 states and 922 transitions. Second operand 4 states. [2018-11-10 10:34:50,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:50,099 INFO L93 Difference]: Finished difference Result 1257 states and 1844 transitions. [2018-11-10 10:34:50,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:34:50,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2018-11-10 10:34:50,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:50,101 INFO L225 Difference]: With dead ends: 1257 [2018-11-10 10:34:50,101 INFO L226 Difference]: Without dead ends: 653 [2018-11-10 10:34:50,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 110 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 10:34:50,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-11-10 10:34:50,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 632. [2018-11-10 10:34:50,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2018-11-10 10:34:50,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 924 transitions. [2018-11-10 10:34:50,131 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 924 transitions. Word has length 113 [2018-11-10 10:34:50,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:50,132 INFO L481 AbstractCegarLoop]: Abstraction has 632 states and 924 transitions. [2018-11-10 10:34:50,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:34:50,132 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 924 transitions. [2018-11-10 10:34:50,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-10 10:34:50,132 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:50,132 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, 1, 1, 1, 1] [2018-11-10 10:34:50,132 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:50,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:50,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1652681162, now seen corresponding path program 1 times [2018-11-10 10:34:50,133 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:34:50,133 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:34:50,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:50,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:34:50,633 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 10:34:50,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:34:50,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:50,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:50,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:50,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:34:50,663 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 10:34:50,666 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 10:34:50,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:50,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:50,668 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 10:34:50,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:34:50,681 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 10:34:50,681 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:34:50,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:50,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:34:50,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:34:50,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:34:50,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:34:50,685 INFO L87 Difference]: Start difference. First operand 632 states and 924 transitions. Second operand 4 states. [2018-11-10 10:34:53,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:53,109 INFO L93 Difference]: Finished difference Result 1006 states and 1467 transitions. [2018-11-10 10:34:53,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:34:53,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2018-11-10 10:34:53,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:53,110 INFO L225 Difference]: With dead ends: 1006 [2018-11-10 10:34:53,110 INFO L226 Difference]: Without dead ends: 354 [2018-11-10 10:34:53,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 111 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 10:34:53,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-11-10 10:34:53,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 347. [2018-11-10 10:34:53,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-11-10 10:34:53,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 517 transitions. [2018-11-10 10:34:53,140 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 517 transitions. Word has length 114 [2018-11-10 10:34:53,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:53,140 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 517 transitions. [2018-11-10 10:34:53,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:34:53,140 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 517 transitions. [2018-11-10 10:34:53,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-10 10:34:53,141 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:53,141 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, 1, 1] [2018-11-10 10:34:53,141 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:53,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:53,141 INFO L82 PathProgramCache]: Analyzing trace with hash 483953184, now seen corresponding path program 1 times [2018-11-10 10:34:53,142 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:34:53,142 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:34:53,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:54,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:34:54,093 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 10:34:54,095 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 10:34:54,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:54,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:54,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:54,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:34:54,118 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 10:34:54,121 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:34:54,123 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 10:34:54,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:54,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:54,139 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 10:34:54,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:34:54,141 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 10:34:54,142 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 10:34:54,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:54,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:54,145 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 10:34:54,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:34:54,158 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 10:34:54,158 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:34:54,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:54,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:34:54,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:34:54,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:34:54,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:34:54,162 INFO L87 Difference]: Start difference. First operand 347 states and 517 transitions. Second operand 7 states. [2018-11-10 10:34:56,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:56,946 INFO L93 Difference]: Finished difference Result 710 states and 1068 transitions. [2018-11-10 10:34:56,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:34:56,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-11-10 10:34:56,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:56,947 INFO L225 Difference]: With dead ends: 710 [2018-11-10 10:34:56,947 INFO L226 Difference]: Without dead ends: 414 [2018-11-10 10:34:56,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 109 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 10:34:56,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-11-10 10:34:56,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 347. [2018-11-10 10:34:56,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-11-10 10:34:56,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 516 transitions. [2018-11-10 10:34:56,967 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 516 transitions. Word has length 115 [2018-11-10 10:34:56,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:56,967 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 516 transitions. [2018-11-10 10:34:56,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:34:56,968 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 516 transitions. [2018-11-10 10:34:56,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-10 10:34:56,968 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:56,968 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, 1, 1] [2018-11-10 10:34:56,968 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:56,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:56,969 INFO L82 PathProgramCache]: Analyzing trace with hash -248014242, now seen corresponding path program 1 times [2018-11-10 10:34:56,969 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:34:56,969 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:34:56,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:57,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:34:57,920 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 10:34:57,922 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 10:34:57,925 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:34:57,926 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 10:34:57,926 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:57,933 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:57,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:57,944 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 10:34:57,944 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:34:57,975 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 10:34:57,975 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:34:57,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:57,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:34:57,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:34:57,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:34:57,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:34:57,979 INFO L87 Difference]: Start difference. First operand 347 states and 516 transitions. Second operand 7 states. [2018-11-10 10:34:58,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:58,664 INFO L93 Difference]: Finished difference Result 705 states and 1061 transitions. [2018-11-10 10:34:58,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:34:58,665 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-11-10 10:34:58,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:58,665 INFO L225 Difference]: With dead ends: 705 [2018-11-10 10:34:58,665 INFO L226 Difference]: Without dead ends: 409 [2018-11-10 10:34:58,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 109 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 10:34:58,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-11-10 10:34:58,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 374. [2018-11-10 10:34:58,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-11-10 10:34:58,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 561 transitions. [2018-11-10 10:34:58,683 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 561 transitions. Word has length 115 [2018-11-10 10:34:58,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:58,683 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 561 transitions. [2018-11-10 10:34:58,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:34:58,684 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 561 transitions. [2018-11-10 10:34:58,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-10 10:34:58,684 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:58,684 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] [2018-11-10 10:34:58,684 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:58,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:58,684 INFO L82 PathProgramCache]: Analyzing trace with hash 714404085, now seen corresponding path program 1 times [2018-11-10 10:34:58,685 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:34:58,685 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:34:58,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:59,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:34:59,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 13 treesize of output 10 [2018-11-10 10:34:59,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 10:34:59,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:59,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:59,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:59,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:34:59,222 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 10:34:59,227 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 10:34:59,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:34:59,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:34:59,235 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 10:34:59,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:34:59,248 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 10:34:59,248 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:34:59,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:59,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:34:59,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:34:59,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:34:59,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:34:59,251 INFO L87 Difference]: Start difference. First operand 374 states and 561 transitions. Second operand 4 states. [2018-11-10 10:35:01,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:01,795 INFO L93 Difference]: Finished difference Result 773 states and 1174 transitions. [2018-11-10 10:35:01,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:35:01,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2018-11-10 10:35:01,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:35:01,797 INFO L225 Difference]: With dead ends: 773 [2018-11-10 10:35:01,797 INFO L226 Difference]: Without dead ends: 450 [2018-11-10 10:35:01,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 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 10:35:01,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-11-10 10:35:01,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 405. [2018-11-10 10:35:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-11-10 10:35:01,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 614 transitions. [2018-11-10 10:35:01,817 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 614 transitions. Word has length 118 [2018-11-10 10:35:01,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:35:01,817 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 614 transitions. [2018-11-10 10:35:01,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:35:01,817 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 614 transitions. [2018-11-10 10:35:01,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 10:35:01,818 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:01,818 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, 1, 1] [2018-11-10 10:35:01,818 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:01,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:01,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1229590027, now seen corresponding path program 1 times [2018-11-10 10:35:01,819 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:35:01,819 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:35:01,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:02,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:02,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 10:35:02,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 10:35:02,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:02,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:02,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:02,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:35:02,820 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 10:35:02,823 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:35:02,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:35:02,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:02,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:02,837 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 10:35:02,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:35:02,840 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 10:35:02,842 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 10:35:02,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:02,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:02,844 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 10:35:02,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:35:02,858 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 10:35:02,858 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:35:02,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:35:02,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:35:02,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:35:02,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:35:02,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:35:02,862 INFO L87 Difference]: Start difference. First operand 405 states and 614 transitions. Second operand 7 states. [2018-11-10 10:35:05,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:05,676 INFO L93 Difference]: Finished difference Result 826 states and 1262 transitions. [2018-11-10 10:35:05,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:35:05,676 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2018-11-10 10:35:05,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:35:05,677 INFO L225 Difference]: With dead ends: 826 [2018-11-10 10:35:05,677 INFO L226 Difference]: Without dead ends: 472 [2018-11-10 10:35:05,678 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 10:35:05,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2018-11-10 10:35:05,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 405. [2018-11-10 10:35:05,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-11-10 10:35:05,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 613 transitions. [2018-11-10 10:35:05,711 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 613 transitions. Word has length 120 [2018-11-10 10:35:05,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:35:05,711 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 613 transitions. [2018-11-10 10:35:05,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:35:05,711 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 613 transitions. [2018-11-10 10:35:05,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-10 10:35:05,712 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:05,712 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, 1, 1] [2018-11-10 10:35:05,712 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:05,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:05,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1757787614, now seen corresponding path program 1 times [2018-11-10 10:35:05,713 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:35:05,713 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:35:05,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:06,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:06,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 13 treesize of output 10 [2018-11-10 10:35:06,844 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 10:35:06,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:06,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:06,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:06,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:35:06,864 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 10:35:06,866 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:35:06,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 10:35:06,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:06,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:06,880 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 10:35:06,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:35:06,883 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 10:35:06,884 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 10:35:06,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:06,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:06,888 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 10:35:06,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:35:06,902 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 10:35:06,902 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:35:06,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:35:06,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:35:06,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:35:06,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:35:06,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:35:06,906 INFO L87 Difference]: Start difference. First operand 405 states and 613 transitions. Second operand 7 states. [2018-11-10 10:35:09,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:09,699 INFO L93 Difference]: Finished difference Result 816 states and 1248 transitions. [2018-11-10 10:35:09,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:35:09,699 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 121 [2018-11-10 10:35:09,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:35:09,700 INFO L225 Difference]: With dead ends: 816 [2018-11-10 10:35:09,700 INFO L226 Difference]: Without dead ends: 462 [2018-11-10 10:35:09,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 115 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 10:35:09,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-11-10 10:35:09,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 405. [2018-11-10 10:35:09,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-11-10 10:35:09,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 612 transitions. [2018-11-10 10:35:09,734 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 612 transitions. Word has length 121 [2018-11-10 10:35:09,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:35:09,734 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 612 transitions. [2018-11-10 10:35:09,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:35:09,734 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 612 transitions. [2018-11-10 10:35:09,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-10 10:35:09,735 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:09,735 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, 1, 1] [2018-11-10 10:35:09,735 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:09,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:09,735 INFO L82 PathProgramCache]: Analyzing trace with hash 691131863, now seen corresponding path program 1 times [2018-11-10 10:35:09,736 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:35:09,736 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:35:09,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:10,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:10,789 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 10:35:10,790 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 10:35:10,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:10,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:10,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:10,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:35:10,811 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 10:35:10,813 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:35:10,815 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 10:35:10,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:10,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:10,828 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 10:35:10,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:35:10,831 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 10:35:10,832 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 10:35:10,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:10,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:10,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 10:35:10,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:35:10,849 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 10:35:10,849 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:35:10,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:35:10,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:35:10,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:35:10,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:35:10,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:35:10,853 INFO L87 Difference]: Start difference. First operand 405 states and 612 transitions. Second operand 7 states. [2018-11-10 10:35:11,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:11,626 INFO L93 Difference]: Finished difference Result 816 states and 1246 transitions. [2018-11-10 10:35:11,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:35:11,626 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 121 [2018-11-10 10:35:11,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:35:11,627 INFO L225 Difference]: With dead ends: 816 [2018-11-10 10:35:11,627 INFO L226 Difference]: Without dead ends: 462 [2018-11-10 10:35:11,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 115 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 10:35:11,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-11-10 10:35:11,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 405. [2018-11-10 10:35:11,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-11-10 10:35:11,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 611 transitions. [2018-11-10 10:35:11,649 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 611 transitions. Word has length 121 [2018-11-10 10:35:11,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:35:11,649 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 611 transitions. [2018-11-10 10:35:11,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:35:11,649 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 611 transitions. [2018-11-10 10:35:11,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-10 10:35:11,649 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:11,650 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, 1, 1] [2018-11-10 10:35:11,650 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:11,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:11,650 INFO L82 PathProgramCache]: Analyzing trace with hash -745596577, now seen corresponding path program 1 times [2018-11-10 10:35:11,651 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:35:11,651 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:35:11,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:12,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:12,656 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 10:35:12,657 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 10:35:12,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:12,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:12,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:12,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:35:12,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 10:35:12,682 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:35:12,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 10:35:12,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:12,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:12,697 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 10:35:12,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:35:12,699 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 10:35:12,700 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 10:35:12,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:12,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:12,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 10:35:12,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:35:12,723 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 10:35:12,723 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:35:12,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:35:12,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:35:12,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:35:12,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:35:12,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:35:12,727 INFO L87 Difference]: Start difference. First operand 405 states and 611 transitions. Second operand 7 states. [2018-11-10 10:35:15,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:15,523 INFO L93 Difference]: Finished difference Result 814 states and 1242 transitions. [2018-11-10 10:35:15,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:35:15,523 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 121 [2018-11-10 10:35:15,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:35:15,524 INFO L225 Difference]: With dead ends: 814 [2018-11-10 10:35:15,524 INFO L226 Difference]: Without dead ends: 460 [2018-11-10 10:35:15,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 115 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 10:35:15,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-11-10 10:35:15,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 405. [2018-11-10 10:35:15,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-11-10 10:35:15,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 610 transitions. [2018-11-10 10:35:15,544 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 610 transitions. Word has length 121 [2018-11-10 10:35:15,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:35:15,544 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 610 transitions. [2018-11-10 10:35:15,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:35:15,544 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 610 transitions. [2018-11-10 10:35:15,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-10 10:35:15,545 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:15,545 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, 1, 1] [2018-11-10 10:35:15,545 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:15,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:15,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1680886816, now seen corresponding path program 1 times [2018-11-10 10:35:15,546 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:35:15,546 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:35:15,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:16,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:16,687 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 10:35:16,688 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 10:35:16,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:16,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:16,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:16,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:35:16,711 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 10:35:16,714 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:35:16,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 10:35:16,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:16,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:16,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 10:35:16,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:35:16,732 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 10:35:16,733 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 10:35:16,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:16,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:16,739 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 10:35:16,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:35:16,755 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 10:35:16,755 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:35:16,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:35:16,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:35:16,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:35:16,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:35:16,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:35:16,760 INFO L87 Difference]: Start difference. First operand 405 states and 610 transitions. Second operand 7 states. [2018-11-10 10:35:19,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:19,506 INFO L93 Difference]: Finished difference Result 772 states and 1175 transitions. [2018-11-10 10:35:19,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:35:19,507 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 121 [2018-11-10 10:35:19,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:35:19,508 INFO L225 Difference]: With dead ends: 772 [2018-11-10 10:35:19,508 INFO L226 Difference]: Without dead ends: 418 [2018-11-10 10:35:19,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 115 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 10:35:19,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-11-10 10:35:19,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 405. [2018-11-10 10:35:19,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-11-10 10:35:19,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 609 transitions. [2018-11-10 10:35:19,527 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 609 transitions. Word has length 121 [2018-11-10 10:35:19,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:35:19,528 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 609 transitions. [2018-11-10 10:35:19,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:35:19,528 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 609 transitions. [2018-11-10 10:35:19,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:35:19,528 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:19,528 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, 1, 1] [2018-11-10 10:35:19,528 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:19,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:19,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1767103891, now seen corresponding path program 1 times [2018-11-10 10:35:19,529 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:35:19,529 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:35:19,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:20,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:20,581 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 10:35:20,583 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 10:35:20,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:20,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:20,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:20,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:35:20,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 23 treesize of output 18 [2018-11-10 10:35:20,604 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:35:20,606 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 10:35:20,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:20,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:20,619 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 10:35:20,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:35:20,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 17 treesize of output 13 [2018-11-10 10:35:20,624 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 10:35:20,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:20,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:20,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 10:35:20,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:35:20,640 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 10:35:20,640 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:35:20,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:35:20,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:35:20,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:35:20,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:35:20,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:35:20,644 INFO L87 Difference]: Start difference. First operand 405 states and 609 transitions. Second operand 7 states. [2018-11-10 10:35:23,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:23,433 INFO L93 Difference]: Finished difference Result 812 states and 1235 transitions. [2018-11-10 10:35:23,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:35:23,434 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 122 [2018-11-10 10:35:23,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:35:23,434 INFO L225 Difference]: With dead ends: 812 [2018-11-10 10:35:23,434 INFO L226 Difference]: Without dead ends: 458 [2018-11-10 10:35:23,435 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 10:35:23,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-11-10 10:35:23,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 405. [2018-11-10 10:35:23,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-11-10 10:35:23,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 608 transitions. [2018-11-10 10:35:23,470 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 608 transitions. Word has length 122 [2018-11-10 10:35:23,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:35:23,470 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 608 transitions. [2018-11-10 10:35:23,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:35:23,471 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 608 transitions. [2018-11-10 10:35:23,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 10:35:23,471 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:23,471 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, 1, 1] [2018-11-10 10:35:23,471 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:23,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:23,472 INFO L82 PathProgramCache]: Analyzing trace with hash -726430541, now seen corresponding path program 1 times [2018-11-10 10:35:23,472 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:35:23,472 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:35:23,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:24,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:24,469 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 10:35:24,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:35:24,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:24,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:24,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:24,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:35:24,497 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 10:35:24,500 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:35:24,501 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 10:35:24,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:24,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:24,513 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 10:35:24,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:35:24,516 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 10:35:24,517 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 10:35:24,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:24,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:24,520 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 10:35:24,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:35:24,535 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 10:35:24,535 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:35:24,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:35:24,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:35:24,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:35:24,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:35:24,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:35:24,539 INFO L87 Difference]: Start difference. First operand 405 states and 608 transitions. Second operand 7 states. [2018-11-10 10:35:27,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:27,319 INFO L93 Difference]: Finished difference Result 809 states and 1229 transitions. [2018-11-10 10:35:27,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:35:27,320 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 122 [2018-11-10 10:35:27,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:35:27,320 INFO L225 Difference]: With dead ends: 809 [2018-11-10 10:35:27,321 INFO L226 Difference]: Without dead ends: 455 [2018-11-10 10:35:27,321 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 10:35:27,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-11-10 10:35:27,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 405. [2018-11-10 10:35:27,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-11-10 10:35:27,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 607 transitions. [2018-11-10 10:35:27,357 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 607 transitions. Word has length 122 [2018-11-10 10:35:27,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:35:27,357 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 607 transitions. [2018-11-10 10:35:27,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:35:27,358 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 607 transitions. [2018-11-10 10:35:27,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 10:35:27,358 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:27,358 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, 1, 1] [2018-11-10 10:35:27,359 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:27,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:27,359 INFO L82 PathProgramCache]: Analyzing trace with hash -531411824, now seen corresponding path program 1 times [2018-11-10 10:35:27,359 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:35:27,359 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:35:27,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:27,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:27,527 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 10:35:27,527 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:35:27,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:35:27,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:35:27,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:35:27,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:35:27,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:35:27,529 INFO L87 Difference]: Start difference. First operand 405 states and 607 transitions. Second operand 3 states. [2018-11-10 10:35:27,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:27,621 INFO L93 Difference]: Finished difference Result 1108 states and 1689 transitions. [2018-11-10 10:35:27,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:35:27,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2018-11-10 10:35:27,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:35:27,622 INFO L225 Difference]: With dead ends: 1108 [2018-11-10 10:35:27,622 INFO L226 Difference]: Without dead ends: 754 [2018-11-10 10:35:27,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 122 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 10:35:27,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2018-11-10 10:35:27,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 752. [2018-11-10 10:35:27,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2018-11-10 10:35:27,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1123 transitions. [2018-11-10 10:35:27,660 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1123 transitions. Word has length 124 [2018-11-10 10:35:27,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:35:27,661 INFO L481 AbstractCegarLoop]: Abstraction has 752 states and 1123 transitions. [2018-11-10 10:35:27,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:35:27,661 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1123 transitions. [2018-11-10 10:35:27,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 10:35:27,661 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:27,661 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, 1, 1] [2018-11-10 10:35:27,661 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:27,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:27,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1428805102, now seen corresponding path program 1 times [2018-11-10 10:35:27,662 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:35:27,662 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:35:27,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:28,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:28,771 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 10:35:28,772 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 10:35:28,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:28,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:28,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:28,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:35:28,793 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 10:35:28,796 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:35:28,798 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 10:35:28,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:28,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:28,811 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 10:35:28,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:35:28,813 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 10:35:28,814 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 10:35:28,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:28,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:28,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 10:35:28,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:35:28,839 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 10:35:28,839 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:35:28,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:35:28,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:35:28,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:35:28,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:35:28,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:35:28,843 INFO L87 Difference]: Start difference. First operand 752 states and 1123 transitions. Second operand 7 states. [2018-11-10 10:35:29,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:29,625 INFO L93 Difference]: Finished difference Result 1552 states and 2319 transitions. [2018-11-10 10:35:29,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:35:29,625 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2018-11-10 10:35:29,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:35:29,627 INFO L225 Difference]: With dead ends: 1552 [2018-11-10 10:35:29,627 INFO L226 Difference]: Without dead ends: 851 [2018-11-10 10:35:29,628 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 10:35:29,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-11-10 10:35:29,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 752. [2018-11-10 10:35:29,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2018-11-10 10:35:29,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1121 transitions. [2018-11-10 10:35:29,667 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1121 transitions. Word has length 124 [2018-11-10 10:35:29,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:35:29,668 INFO L481 AbstractCegarLoop]: Abstraction has 752 states and 1121 transitions. [2018-11-10 10:35:29,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:35:29,668 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1121 transitions. [2018-11-10 10:35:29,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:35:29,669 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:29,669 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, 1, 1] [2018-11-10 10:35:29,669 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:29,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:29,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1074503396, now seen corresponding path program 1 times [2018-11-10 10:35:29,670 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:35:29,670 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:35:29,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:30,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:30,843 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 10:35:30,845 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 10:35:30,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:30,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:30,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:30,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:35:30,866 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 10:35:30,869 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:35:30,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 10:35:30,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:30,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:30,883 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 10:35:30,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:35:30,886 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 10:35:30,887 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 10:35:30,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:30,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:30,889 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 10:35:30,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:35:30,904 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 10:35:30,904 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:35:30,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:35:30,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:35:30,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:35:30,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:35:30,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:35:30,908 INFO L87 Difference]: Start difference. First operand 752 states and 1121 transitions. Second operand 7 states. [2018-11-10 10:35:33,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:33,697 INFO L93 Difference]: Finished difference Result 1536 states and 2289 transitions. [2018-11-10 10:35:33,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:35:33,697 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2018-11-10 10:35:33,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:35:33,699 INFO L225 Difference]: With dead ends: 1536 [2018-11-10 10:35:33,699 INFO L226 Difference]: Without dead ends: 835 [2018-11-10 10:35:33,699 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 10:35:33,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2018-11-10 10:35:33,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 752. [2018-11-10 10:35:33,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2018-11-10 10:35:33,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1119 transitions. [2018-11-10 10:35:33,740 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1119 transitions. Word has length 125 [2018-11-10 10:35:33,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:35:33,740 INFO L481 AbstractCegarLoop]: Abstraction has 752 states and 1119 transitions. [2018-11-10 10:35:33,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:35:33,740 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1119 transitions. [2018-11-10 10:35:33,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:35:33,741 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:33,741 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 10:35:33,741 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:33,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:33,741 INFO L82 PathProgramCache]: Analyzing trace with hash -610512905, now seen corresponding path program 1 times [2018-11-10 10:35:33,742 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:35:33,742 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:35:33,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:34,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:34,288 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 10:35:34,289 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 10:35:34,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:34,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:34,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:34,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:35:34,301 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 10:35:34,303 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 10:35:34,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:34,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:34,307 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 10:35:34,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:35:34,319 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 10:35:34,319 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:35:34,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:35:34,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:35:34,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:35:34,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:35:34,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:35:34,322 INFO L87 Difference]: Start difference. First operand 752 states and 1119 transitions. Second operand 4 states. [2018-11-10 10:35:36,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:36,785 INFO L93 Difference]: Finished difference Result 1545 states and 2306 transitions. [2018-11-10 10:35:36,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:35:36,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2018-11-10 10:35:36,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:35:36,787 INFO L225 Difference]: With dead ends: 1545 [2018-11-10 10:35:36,787 INFO L226 Difference]: Without dead ends: 844 [2018-11-10 10:35:36,788 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 10:35:36,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2018-11-10 10:35:36,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 784. [2018-11-10 10:35:36,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2018-11-10 10:35:36,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1171 transitions. [2018-11-10 10:35:36,828 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1171 transitions. Word has length 125 [2018-11-10 10:35:36,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:35:36,829 INFO L481 AbstractCegarLoop]: Abstraction has 784 states and 1171 transitions. [2018-11-10 10:35:36,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:35:36,829 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1171 transitions. [2018-11-10 10:35:36,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-10 10:35:36,830 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:36,830 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, 1, 1] [2018-11-10 10:35:36,830 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:36,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:36,830 INFO L82 PathProgramCache]: Analyzing trace with hash 688533703, now seen corresponding path program 1 times [2018-11-10 10:35:36,831 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:35:36,831 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:35:36,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:37,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:37,807 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 10:35:37,809 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 10:35:37,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:37,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:37,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:37,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:35:37,834 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 10:35:37,837 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:35:37,840 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 10:35:37,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:37,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:37,855 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 10:35:37,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:35:37,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 10:35:37,860 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 10:35:37,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:37,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:37,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 10:35:37,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:35:37,883 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 10:35:37,883 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:35:37,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:35:37,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:35:37,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:35:37,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:35:37,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:35:37,887 INFO L87 Difference]: Start difference. First operand 784 states and 1171 transitions. Second operand 7 states. [2018-11-10 10:35:38,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:38,667 INFO L93 Difference]: Finished difference Result 1600 states and 2389 transitions. [2018-11-10 10:35:38,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:35:38,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 126 [2018-11-10 10:35:38,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:35:38,669 INFO L225 Difference]: With dead ends: 1600 [2018-11-10 10:35:38,669 INFO L226 Difference]: Without dead ends: 867 [2018-11-10 10:35:38,670 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 10:35:38,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-11-10 10:35:38,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 784. [2018-11-10 10:35:38,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2018-11-10 10:35:38,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1169 transitions. [2018-11-10 10:35:38,728 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1169 transitions. Word has length 126 [2018-11-10 10:35:38,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:35:38,729 INFO L481 AbstractCegarLoop]: Abstraction has 784 states and 1169 transitions. [2018-11-10 10:35:38,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:35:38,729 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1169 transitions. [2018-11-10 10:35:38,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 10:35:38,729 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:38,729 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, 1, 1] [2018-11-10 10:35:38,729 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:38,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:38,730 INFO L82 PathProgramCache]: Analyzing trace with hash -2013258762, now seen corresponding path program 1 times [2018-11-10 10:35:38,730 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:35:38,730 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:35:38,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:39,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:39,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 10:35:39,719 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 10:35:39,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:39,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:39,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:39,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:35:39,739 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 10:35:39,741 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:35:39,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 10:35:39,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:39,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:39,755 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 10:35:39,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:35:39,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 17 treesize of output 13 [2018-11-10 10:35:39,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 13 treesize of output 5 [2018-11-10 10:35:39,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:39,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:39,762 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 10:35:39,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:35:39,778 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 10:35:39,778 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:35:39,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:35:39,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:35:39,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:35:39,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:35:39,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:35:39,783 INFO L87 Difference]: Start difference. First operand 784 states and 1169 transitions. Second operand 7 states. [2018-11-10 10:35:42,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:42,573 INFO L93 Difference]: Finished difference Result 1594 states and 2378 transitions. [2018-11-10 10:35:42,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:35:42,573 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 127 [2018-11-10 10:35:42,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:35:42,574 INFO L225 Difference]: With dead ends: 1594 [2018-11-10 10:35:42,574 INFO L226 Difference]: Without dead ends: 861 [2018-11-10 10:35:42,574 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 10:35:42,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-11-10 10:35:42,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 784. [2018-11-10 10:35:42,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2018-11-10 10:35:42,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1167 transitions. [2018-11-10 10:35:42,614 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1167 transitions. Word has length 127 [2018-11-10 10:35:42,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:35:42,614 INFO L481 AbstractCegarLoop]: Abstraction has 784 states and 1167 transitions. [2018-11-10 10:35:42,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:35:42,614 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1167 transitions. [2018-11-10 10:35:42,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 10:35:42,614 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:42,614 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, 1, 1] [2018-11-10 10:35:42,615 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:42,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:42,615 INFO L82 PathProgramCache]: Analyzing trace with hash -931767889, now seen corresponding path program 1 times [2018-11-10 10:35:42,615 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:35:42,615 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:35:42,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:43,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:43,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 10:35:43,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 10:35:43,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:43,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:43,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:43,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:35:43,163 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 10:35:43,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 10:35:43,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:43,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:43,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 10:35:43,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:35:43,179 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 10:35:43,179 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:35:43,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:35:43,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:35:43,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:35:43,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:35:43,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:35:43,183 INFO L87 Difference]: Start difference. First operand 784 states and 1167 transitions. Second operand 4 states. [2018-11-10 10:35:45,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:45,831 INFO L93 Difference]: Finished difference Result 1702 states and 2548 transitions. [2018-11-10 10:35:45,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:35:45,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-11-10 10:35:45,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:35:45,832 INFO L225 Difference]: With dead ends: 1702 [2018-11-10 10:35:45,832 INFO L226 Difference]: Without dead ends: 969 [2018-11-10 10:35:45,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 124 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 10:35:45,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2018-11-10 10:35:45,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 856. [2018-11-10 10:35:45,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-11-10 10:35:45,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1293 transitions. [2018-11-10 10:35:45,873 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1293 transitions. Word has length 127 [2018-11-10 10:35:45,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:35:45,873 INFO L481 AbstractCegarLoop]: Abstraction has 856 states and 1293 transitions. [2018-11-10 10:35:45,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:35:45,873 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1293 transitions. [2018-11-10 10:35:45,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:35:45,874 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:45,874 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, 1, 1] [2018-11-10 10:35:45,874 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:45,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:45,874 INFO L82 PathProgramCache]: Analyzing trace with hash -144502945, now seen corresponding path program 1 times [2018-11-10 10:35:45,874 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:35:45,875 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:35:45,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:46,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:46,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 13 treesize of output 10 [2018-11-10 10:35:46,883 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 10:35:46,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:46,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:46,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:46,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:35:46,907 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 10:35:46,910 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:35:46,911 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 10:35:46,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:46,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:46,927 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 10:35:46,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:35:46,930 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 10:35:46,932 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 10:35:46,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:46,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:46,934 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 10:35:46,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:35:46,950 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 10:35:46,950 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:35:46,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:35:46,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:35:46,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:35:46,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:35:46,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:35:46,955 INFO L87 Difference]: Start difference. First operand 856 states and 1293 transitions. Second operand 7 states. [2018-11-10 10:35:47,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:47,711 INFO L93 Difference]: Finished difference Result 1738 states and 2626 transitions. [2018-11-10 10:35:47,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:35:47,711 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2018-11-10 10:35:47,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:35:47,712 INFO L225 Difference]: With dead ends: 1738 [2018-11-10 10:35:47,712 INFO L226 Difference]: Without dead ends: 933 [2018-11-10 10:35:47,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 122 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 10:35:47,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2018-11-10 10:35:47,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 856. [2018-11-10 10:35:47,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-11-10 10:35:47,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1291 transitions. [2018-11-10 10:35:47,757 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1291 transitions. Word has length 128 [2018-11-10 10:35:47,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:35:47,757 INFO L481 AbstractCegarLoop]: Abstraction has 856 states and 1291 transitions. [2018-11-10 10:35:47,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:35:47,757 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1291 transitions. [2018-11-10 10:35:47,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-10 10:35:47,758 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:47,759 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, 1, 1] [2018-11-10 10:35:47,759 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:47,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:47,759 INFO L82 PathProgramCache]: Analyzing trace with hash 352615278, now seen corresponding path program 1 times [2018-11-10 10:35:47,759 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:35:47,760 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:35:47,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:48,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:48,768 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 10:35:48,769 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 10:35:48,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:48,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:48,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:48,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:35:48,789 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 10:35:48,792 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:35:48,794 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 10:35:48,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:48,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:48,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 10:35:48,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:35:48,810 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 10:35:48,811 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 10:35:48,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:48,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:48,813 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 10:35:48,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:35:48,836 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 10:35:48,836 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:35:48,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:35:48,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:35:48,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:35:48,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:35:48,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:35:48,840 INFO L87 Difference]: Start difference. First operand 856 states and 1291 transitions. Second operand 7 states. [2018-11-10 10:35:51,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:51,640 INFO L93 Difference]: Finished difference Result 1732 states and 2615 transitions. [2018-11-10 10:35:51,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:35:51,640 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 129 [2018-11-10 10:35:51,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:35:51,641 INFO L225 Difference]: With dead ends: 1732 [2018-11-10 10:35:51,641 INFO L226 Difference]: Without dead ends: 927 [2018-11-10 10:35:51,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 123 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 10:35:51,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-11-10 10:35:51,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 856. [2018-11-10 10:35:51,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-11-10 10:35:51,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1289 transitions. [2018-11-10 10:35:51,699 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1289 transitions. Word has length 129 [2018-11-10 10:35:51,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:35:51,699 INFO L481 AbstractCegarLoop]: Abstraction has 856 states and 1289 transitions. [2018-11-10 10:35:51,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:35:51,699 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1289 transitions. [2018-11-10 10:35:51,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 10:35:51,699 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:51,700 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, 1, 1] [2018-11-10 10:35:51,700 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:51,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:51,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1883428026, now seen corresponding path program 1 times [2018-11-10 10:35:51,700 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:35:51,700 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:35:51,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:52,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:52,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 10:35:52,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 10:35:52,880 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:35:52,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 10:35:52,882 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:52,889 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:52,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:52,900 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 10:35:52,901 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:35:52,912 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 10:35:52,913 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 10:35:52,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:52,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:52,917 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 10:35:52,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:35:52,932 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 10:35:52,932 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:35:52,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:35:52,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:35:52,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:35:52,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:35:52,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:35:52,937 INFO L87 Difference]: Start difference. First operand 856 states and 1289 transitions. Second operand 7 states. [2018-11-10 10:35:53,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:53,741 INFO L93 Difference]: Finished difference Result 1730 states and 2603 transitions. [2018-11-10 10:35:53,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:35:53,742 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 131 [2018-11-10 10:35:53,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:35:53,743 INFO L225 Difference]: With dead ends: 1730 [2018-11-10 10:35:53,743 INFO L226 Difference]: Without dead ends: 925 [2018-11-10 10:35:53,743 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 10:35:53,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-11-10 10:35:53,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 856. [2018-11-10 10:35:53,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-11-10 10:35:53,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1287 transitions. [2018-11-10 10:35:53,790 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1287 transitions. Word has length 131 [2018-11-10 10:35:53,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:35:53,790 INFO L481 AbstractCegarLoop]: Abstraction has 856 states and 1287 transitions. [2018-11-10 10:35:53,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:35:53,790 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1287 transitions. [2018-11-10 10:35:53,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-10 10:35:53,791 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:53,791 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, 1, 1] [2018-11-10 10:35:53,791 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:53,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:53,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1403715890, now seen corresponding path program 1 times [2018-11-10 10:35:53,792 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:35:53,792 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:35:53,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:54,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:54,974 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 10:35:54,975 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 10:35:54,979 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:35:54,981 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 10:35:54,981 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:54,986 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:54,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:54,997 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 10:35:54,997 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:35:55,008 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 10:35:55,009 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 10:35:55,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:55,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:55,014 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 10:35:55,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:35:55,029 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 10:35:55,029 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:35:55,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:35:55,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:35:55,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:35:55,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:35:55,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:35:55,033 INFO L87 Difference]: Start difference. First operand 856 states and 1287 transitions. Second operand 7 states. [2018-11-10 10:35:57,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:57,851 INFO L93 Difference]: Finished difference Result 1730 states and 2599 transitions. [2018-11-10 10:35:57,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:35:57,852 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2018-11-10 10:35:57,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:35:57,853 INFO L225 Difference]: With dead ends: 1730 [2018-11-10 10:35:57,853 INFO L226 Difference]: Without dead ends: 925 [2018-11-10 10:35:57,853 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 10:35:57,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-11-10 10:35:57,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 856. [2018-11-10 10:35:57,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-11-10 10:35:57,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1285 transitions. [2018-11-10 10:35:57,895 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1285 transitions. Word has length 132 [2018-11-10 10:35:57,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:35:57,895 INFO L481 AbstractCegarLoop]: Abstraction has 856 states and 1285 transitions. [2018-11-10 10:35:57,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:35:57,895 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1285 transitions. [2018-11-10 10:35:57,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-10 10:35:57,896 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:35:57,896 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, 1, 1] [2018-11-10 10:35:57,896 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:35:57,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:57,897 INFO L82 PathProgramCache]: Analyzing trace with hash -620242207, now seen corresponding path program 1 times [2018-11-10 10:35:57,897 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:35:57,897 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:35:57,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:59,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:59,107 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 10:35:59,109 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 10:35:59,113 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:35:59,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, 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 10:35:59,115 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:59,121 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:59,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:59,132 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 10:35:59,133 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:35:59,146 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 10:35:59,147 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 10:35:59,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:59,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:59,152 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 10:35:59,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:35:59,167 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 10:35:59,167 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:35:59,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:35:59,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:35:59,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:35:59,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:35:59,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:35:59,172 INFO L87 Difference]: Start difference. First operand 856 states and 1285 transitions. Second operand 7 states. [2018-11-10 10:36:01,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:36:01,982 INFO L93 Difference]: Finished difference Result 1730 states and 2595 transitions. [2018-11-10 10:36:01,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:36:01,983 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 133 [2018-11-10 10:36:01,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:36:01,984 INFO L225 Difference]: With dead ends: 1730 [2018-11-10 10:36:01,984 INFO L226 Difference]: Without dead ends: 925 [2018-11-10 10:36:01,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 127 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 10:36:01,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-11-10 10:36:02,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 856. [2018-11-10 10:36:02,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-11-10 10:36:02,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1283 transitions. [2018-11-10 10:36:02,026 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1283 transitions. Word has length 133 [2018-11-10 10:36:02,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:36:02,026 INFO L481 AbstractCegarLoop]: Abstraction has 856 states and 1283 transitions. [2018-11-10 10:36:02,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:36:02,026 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1283 transitions. [2018-11-10 10:36:02,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-10 10:36:02,027 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:36:02,027 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, 1, 1] [2018-11-10 10:36:02,027 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:36:02,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:36:02,027 INFO L82 PathProgramCache]: Analyzing trace with hash 989904841, now seen corresponding path program 1 times [2018-11-10 10:36:02,028 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:36:02,028 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:36:02,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:36:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:36:03,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:36:03,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 18 treesize of output 15 [2018-11-10 10:36:03,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:36:03,238 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:36:03,240 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 10:36:03,240 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:03,245 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:03,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:03,256 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 10:36:03,256 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:36:03,268 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 10:36:03,269 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 10:36:03,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:03,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:03,273 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 10:36:03,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:36:03,289 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 10:36:03,289 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:36:03,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:36:03,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:36:03,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:36:03,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:36:03,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:36:03,293 INFO L87 Difference]: Start difference. First operand 856 states and 1283 transitions. Second operand 7 states. [2018-11-10 10:36:04,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:36:04,077 INFO L93 Difference]: Finished difference Result 1710 states and 2565 transitions. [2018-11-10 10:36:04,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:36:04,078 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 134 [2018-11-10 10:36:04,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:36:04,079 INFO L225 Difference]: With dead ends: 1710 [2018-11-10 10:36:04,079 INFO L226 Difference]: Without dead ends: 905 [2018-11-10 10:36:04,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 128 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 10:36:04,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-11-10 10:36:04,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 856. [2018-11-10 10:36:04,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-11-10 10:36:04,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1281 transitions. [2018-11-10 10:36:04,122 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1281 transitions. Word has length 134 [2018-11-10 10:36:04,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:36:04,122 INFO L481 AbstractCegarLoop]: Abstraction has 856 states and 1281 transitions. [2018-11-10 10:36:04,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:36:04,122 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1281 transitions. [2018-11-10 10:36:04,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-10 10:36:04,123 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:36:04,123 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] [2018-11-10 10:36:04,123 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:36:04,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:36:04,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1067965209, now seen corresponding path program 1 times [2018-11-10 10:36:04,124 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:36:04,124 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:36:04,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:36:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:36:04,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:36:04,284 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 10:36:04,284 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:36:04,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:36:04,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:36:04,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:36:04,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:36:04,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:36:04,287 INFO L87 Difference]: Start difference. First operand 856 states and 1281 transitions. Second operand 3 states. [2018-11-10 10:36:04,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:36:04,364 INFO L93 Difference]: Finished difference Result 1712 states and 2569 transitions. [2018-11-10 10:36:04,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:36:04,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2018-11-10 10:36:04,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:36:04,368 INFO L225 Difference]: With dead ends: 1712 [2018-11-10 10:36:04,368 INFO L226 Difference]: Without dead ends: 907 [2018-11-10 10:36:04,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 132 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 10:36:04,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2018-11-10 10:36:04,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 907. [2018-11-10 10:36:04,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2018-11-10 10:36:04,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1349 transitions. [2018-11-10 10:36:04,415 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1349 transitions. Word has length 134 [2018-11-10 10:36:04,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:36:04,416 INFO L481 AbstractCegarLoop]: Abstraction has 907 states and 1349 transitions. [2018-11-10 10:36:04,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:36:04,416 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1349 transitions. [2018-11-10 10:36:04,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-10 10:36:04,416 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:36:04,416 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, 1, 1] [2018-11-10 10:36:04,417 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:36:04,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:36:04,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1268524905, now seen corresponding path program 1 times [2018-11-10 10:36:04,417 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:36:04,417 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:36:04,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:36:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:36:05,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:36:05,574 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 10:36:05,575 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 10:36:05,578 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:36:05,580 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 10:36:05,580 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:05,585 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:05,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:05,597 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 10:36:05,597 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:36:05,609 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 10:36:05,610 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 10:36:05,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:05,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:05,613 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 10:36:05,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:36:05,632 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 10:36:05,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:36:05,652 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 10:36:05,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:05,653 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 10:36:05,653 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-10 10:36:05,667 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 10:36:05,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:36:05,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 10:36:05,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:36:05,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:36:05,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:36:05,671 INFO L87 Difference]: Start difference. First operand 907 states and 1349 transitions. Second operand 9 states. [2018-11-10 10:36:09,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:36:09,030 INFO L93 Difference]: Finished difference Result 2297 states and 3427 transitions. [2018-11-10 10:36:09,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:36:09,031 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2018-11-10 10:36:09,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:36:09,031 INFO L225 Difference]: With dead ends: 2297 [2018-11-10 10:36:09,032 INFO L226 Difference]: Without dead ends: 1441 [2018-11-10 10:36:09,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 269 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 10:36:09,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2018-11-10 10:36:09,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 989. [2018-11-10 10:36:09,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2018-11-10 10:36:09,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1493 transitions. [2018-11-10 10:36:09,083 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1493 transitions. Word has length 137 [2018-11-10 10:36:09,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:36:09,083 INFO L481 AbstractCegarLoop]: Abstraction has 989 states and 1493 transitions. [2018-11-10 10:36:09,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:36:09,083 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1493 transitions. [2018-11-10 10:36:09,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-10 10:36:09,084 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:36:09,084 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, 1, 1, 1, 1] [2018-11-10 10:36:09,084 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:36:09,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:36:09,085 INFO L82 PathProgramCache]: Analyzing trace with hash 359789298, now seen corresponding path program 1 times [2018-11-10 10:36:09,085 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:36:09,085 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:36:09,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:36:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:36:10,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:36:10,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 18 treesize of output 15 [2018-11-10 10:36:10,266 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 10:36:10,269 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:36:10,271 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 10:36:10,271 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:10,276 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:10,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:10,288 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 10:36:10,289 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:36:10,301 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 10:36:10,302 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 10:36:10,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:10,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:10,304 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 10:36:10,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:36:10,324 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 10:36:10,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:36:10,344 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 10:36:10,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:10,344 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 10:36:10,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-10 10:36:10,356 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 10:36:10,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:36:10,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 10:36:10,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:36:10,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:36:10,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:36:10,361 INFO L87 Difference]: Start difference. First operand 989 states and 1493 transitions. Second operand 9 states. [2018-11-10 10:36:13,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:36:13,734 INFO L93 Difference]: Finished difference Result 2409 states and 3637 transitions. [2018-11-10 10:36:13,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:36:13,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 138 [2018-11-10 10:36:13,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:36:13,735 INFO L225 Difference]: With dead ends: 2409 [2018-11-10 10:36:13,736 INFO L226 Difference]: Without dead ends: 1471 [2018-11-10 10:36:13,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 271 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 10:36:13,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2018-11-10 10:36:13,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1031. [2018-11-10 10:36:13,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2018-11-10 10:36:13,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1579 transitions. [2018-11-10 10:36:13,789 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1579 transitions. Word has length 138 [2018-11-10 10:36:13,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:36:13,789 INFO L481 AbstractCegarLoop]: Abstraction has 1031 states and 1579 transitions. [2018-11-10 10:36:13,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:36:13,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1579 transitions. [2018-11-10 10:36:13,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-10 10:36:13,790 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:36:13,791 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, 1, 1, 1, 1] [2018-11-10 10:36:13,791 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:36:13,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:36:13,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1791025874, now seen corresponding path program 1 times [2018-11-10 10:36:13,791 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:36:13,792 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:36:13,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:36:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:36:14,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:36:14,961 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 10:36:14,963 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 10:36:14,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:14,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:14,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:14,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:36:14,982 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 10:36:14,985 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:36:14,988 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 10:36:14,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:14,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:15,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 10:36:15,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:36:15,030 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 10:36:15,030 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:36:15,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:36:15,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:36:15,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:36:15,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:36:15,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:36:15,034 INFO L87 Difference]: Start difference. First operand 1031 states and 1579 transitions. Second operand 7 states. [2018-11-10 10:36:17,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:36:17,752 INFO L93 Difference]: Finished difference Result 2069 states and 3170 transitions. [2018-11-10 10:36:17,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:36:17,752 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2018-11-10 10:36:17,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:36:17,753 INFO L225 Difference]: With dead ends: 2069 [2018-11-10 10:36:17,753 INFO L226 Difference]: Without dead ends: 1089 [2018-11-10 10:36:17,754 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 133 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 10:36:17,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2018-11-10 10:36:17,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1037. [2018-11-10 10:36:17,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2018-11-10 10:36:17,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1585 transitions. [2018-11-10 10:36:17,804 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1585 transitions. Word has length 139 [2018-11-10 10:36:17,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:36:17,804 INFO L481 AbstractCegarLoop]: Abstraction has 1037 states and 1585 transitions. [2018-11-10 10:36:17,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:36:17,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1585 transitions. [2018-11-10 10:36:17,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-10 10:36:17,805 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:36:17,805 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, 1, 1] [2018-11-10 10:36:17,806 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:36:17,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:36:17,806 INFO L82 PathProgramCache]: Analyzing trace with hash -751085099, now seen corresponding path program 1 times [2018-11-10 10:36:17,806 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:36:17,806 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:36:17,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:36:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:36:18,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:36:18,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 10:36:18,507 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 10:36:18,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:18,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:18,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:18,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:36:18,525 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 10:36:18,527 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 10:36:18,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:18,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:18,529 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 10:36:18,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:36:18,544 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 10:36:18,544 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:36:18,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:36:18,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:36:18,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:36:18,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:36:18,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:36:18,548 INFO L87 Difference]: Start difference. First operand 1037 states and 1585 transitions. Second operand 4 states. [2018-11-10 10:36:21,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:36:21,168 INFO L93 Difference]: Finished difference Result 2131 states and 3249 transitions. [2018-11-10 10:36:21,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:36:21,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-11-10 10:36:21,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:36:21,170 INFO L225 Difference]: With dead ends: 2131 [2018-11-10 10:36:21,170 INFO L226 Difference]: Without dead ends: 1145 [2018-11-10 10:36:21,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 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 10:36:21,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2018-11-10 10:36:21,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1037. [2018-11-10 10:36:21,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2018-11-10 10:36:21,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1583 transitions. [2018-11-10 10:36:21,225 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1583 transitions. Word has length 157 [2018-11-10 10:36:21,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:36:21,225 INFO L481 AbstractCegarLoop]: Abstraction has 1037 states and 1583 transitions. [2018-11-10 10:36:21,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:36:21,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1583 transitions. [2018-11-10 10:36:21,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-10 10:36:21,226 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:36:21,226 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, 1, 1, 1, 1] [2018-11-10 10:36:21,227 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:36:21,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:36:21,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1743639229, now seen corresponding path program 1 times [2018-11-10 10:36:21,227 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:36:21,228 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:36:21,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:36:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:36:22,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:36:22,652 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 10:36:22,654 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 10:36:22,656 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:36:22,658 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 10:36:22,658 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:22,671 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:22,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:22,683 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 10:36:22,683 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:36:22,695 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 10:36:22,696 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 10:36:22,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:22,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:22,698 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 10:36:22,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:36:22,720 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 10:36:22,720 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:36:22,740 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 10:36:22,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:22,740 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 10:36:22,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-10 10:36:22,761 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 10:36:22,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:36:22,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 10:36:22,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:36:22,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:36:22,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:36:22,766 INFO L87 Difference]: Start difference. First operand 1037 states and 1583 transitions. Second operand 9 states. [2018-11-10 10:36:26,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:36:26,262 INFO L93 Difference]: Finished difference Result 2609 states and 3995 transitions. [2018-11-10 10:36:26,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:36:26,262 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 167 [2018-11-10 10:36:26,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:36:26,264 INFO L225 Difference]: With dead ends: 2609 [2018-11-10 10:36:26,264 INFO L226 Difference]: Without dead ends: 1623 [2018-11-10 10:36:26,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 329 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 10:36:26,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2018-11-10 10:36:26,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1169. [2018-11-10 10:36:26,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1169 states. [2018-11-10 10:36:26,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1811 transitions. [2018-11-10 10:36:26,329 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1811 transitions. Word has length 167 [2018-11-10 10:36:26,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:36:26,329 INFO L481 AbstractCegarLoop]: Abstraction has 1169 states and 1811 transitions. [2018-11-10 10:36:26,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:36:26,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1811 transitions. [2018-11-10 10:36:26,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-10 10:36:26,331 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:36:26,331 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, 1, 1, 1, 1] [2018-11-10 10:36:26,331 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:36:26,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:36:26,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1135663639, now seen corresponding path program 1 times [2018-11-10 10:36:26,332 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:36:26,332 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:36:26,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:36:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:36:27,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:36:27,860 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 10:36:27,862 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 10:36:27,865 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:36:27,867 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 10:36:27,867 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:27,875 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:27,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:27,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 10:36:27,887 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:36:27,900 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 10:36:27,901 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 10:36:27,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:27,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:27,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 10:36:27,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:36:27,927 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 10:36:27,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:36:27,947 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 10:36:27,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:27,948 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 10:36:27,948 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-10 10:36:27,964 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 10:36:27,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:36:27,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 10:36:27,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:36:27,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:36:27,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:36:27,968 INFO L87 Difference]: Start difference. First operand 1169 states and 1811 transitions. Second operand 9 states. [2018-11-10 10:36:31,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:36:31,351 INFO L93 Difference]: Finished difference Result 2799 states and 4311 transitions. [2018-11-10 10:36:31,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:36:31,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 173 [2018-11-10 10:36:31,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:36:31,353 INFO L225 Difference]: With dead ends: 2799 [2018-11-10 10:36:31,353 INFO L226 Difference]: Without dead ends: 1681 [2018-11-10 10:36:31,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 341 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 10:36:31,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2018-11-10 10:36:31,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1245. [2018-11-10 10:36:31,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1245 states. [2018-11-10 10:36:31,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1941 transitions. [2018-11-10 10:36:31,420 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1941 transitions. Word has length 173 [2018-11-10 10:36:31,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:36:31,420 INFO L481 AbstractCegarLoop]: Abstraction has 1245 states and 1941 transitions. [2018-11-10 10:36:31,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:36:31,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1941 transitions. [2018-11-10 10:36:31,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-10 10:36:31,421 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:36:31,421 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, 1, 1, 1, 1] [2018-11-10 10:36:31,421 INFO L424 AbstractCegarLoop]: === Iteration 91 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:36:31,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:36:31,422 INFO L82 PathProgramCache]: Analyzing trace with hash -308595164, now seen corresponding path program 1 times [2018-11-10 10:36:31,422 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:36:31,422 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:36:31,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:36:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:36:32,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:36:32,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, 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 10:36:32,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:36:32,947 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:36:32,949 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 10:36:32,949 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:32,955 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:32,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:32,967 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 10:36:32,967 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:36:32,979 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 10:36:32,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, 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 10:36:32,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:32,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:32,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 10:36:32,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:36:33,007 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 10:36:33,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:36:33,027 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 10:36:33,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:33,027 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 10:36:33,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 10:36:33,045 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 10:36:33,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:36:33,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 10:36:33,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:36:33,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:36:33,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:36:33,050 INFO L87 Difference]: Start difference. First operand 1245 states and 1941 transitions. Second operand 9 states. [2018-11-10 10:36:38,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:36:38,442 INFO L93 Difference]: Finished difference Result 2863 states and 4420 transitions. [2018-11-10 10:36:38,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:36:38,443 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 174 [2018-11-10 10:36:38,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:36:38,444 INFO L225 Difference]: With dead ends: 2863 [2018-11-10 10:36:38,444 INFO L226 Difference]: Without dead ends: 1669 [2018-11-10 10:36:38,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 343 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 10:36:38,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2018-11-10 10:36:38,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1245. [2018-11-10 10:36:38,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1245 states. [2018-11-10 10:36:38,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1937 transitions. [2018-11-10 10:36:38,506 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1937 transitions. Word has length 174 [2018-11-10 10:36:38,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:36:38,506 INFO L481 AbstractCegarLoop]: Abstraction has 1245 states and 1937 transitions. [2018-11-10 10:36:38,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:36:38,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1937 transitions. [2018-11-10 10:36:38,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-10 10:36:38,507 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:36:38,507 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, 1, 1] [2018-11-10 10:36:38,507 INFO L424 AbstractCegarLoop]: === Iteration 92 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:36:38,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:36:38,508 INFO L82 PathProgramCache]: Analyzing trace with hash 609362711, now seen corresponding path program 1 times [2018-11-10 10:36:38,508 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:36:38,508 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:36:38,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:36:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:36:40,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:36:40,271 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 10:36:40,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:36:40,275 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:36:40,277 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 10:36:40,277 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:40,286 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:40,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:40,297 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 10:36:40,298 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:36:40,309 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 10:36:40,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 10:36:40,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:40,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:40,321 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 10:36:40,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:36:40,340 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 10:36:40,341 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:36:40,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:36:40,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:36:40,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:36:40,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:36:40,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:36:40,346 INFO L87 Difference]: Start difference. First operand 1245 states and 1937 transitions. Second operand 7 states. [2018-11-10 10:36:41,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:36:41,145 INFO L93 Difference]: Finished difference Result 2469 states and 3850 transitions. [2018-11-10 10:36:41,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:36:41,146 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 174 [2018-11-10 10:36:41,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:36:41,146 INFO L225 Difference]: With dead ends: 2469 [2018-11-10 10:36:41,146 INFO L226 Difference]: Without dead ends: 1275 [2018-11-10 10:36:41,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 168 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 10:36:41,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2018-11-10 10:36:41,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1245. [2018-11-10 10:36:41,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1245 states. [2018-11-10 10:36:41,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1935 transitions. [2018-11-10 10:36:41,207 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1935 transitions. Word has length 174 [2018-11-10 10:36:41,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:36:41,208 INFO L481 AbstractCegarLoop]: Abstraction has 1245 states and 1935 transitions. [2018-11-10 10:36:41,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:36:41,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1935 transitions. [2018-11-10 10:36:41,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-10 10:36:41,209 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:36:41,209 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, 1, 1, 1, 1, 1, 1] [2018-11-10 10:36:41,209 INFO L424 AbstractCegarLoop]: === Iteration 93 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:36:41,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:36:41,209 INFO L82 PathProgramCache]: Analyzing trace with hash 72233480, now seen corresponding path program 1 times [2018-11-10 10:36:41,209 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:36:41,210 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:36:41,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:36:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:36:43,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:36:43,903 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:36:43,904 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 10:36:43,922 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 10:36:43,939 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:36:43,942 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:36:43,946 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:36:43,946 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 10:36:43,947 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:43,966 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:44,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:44,066 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 10:36:44,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 10:36:44,072 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:36:44,074 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 10:36:44,079 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:36:44,080 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:36:44,081 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:36:44,084 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 10:36:44,084 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:44,095 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:44,103 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:44,111 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:44,141 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 10:36:44,147 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 10:36:44,147 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:44,152 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:44,176 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 10:36:44,176 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:62, output treesize:65 [2018-11-10 10:36:44,260 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:36:44,289 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 10:36:44,292 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 10:36:44,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:44,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:44,327 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 10:36:44,330 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:36:44,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-11-10 10:36:44,331 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:44,337 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:44,353 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 10:36:44,354 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:82, output treesize:46 [2018-11-10 10:36:44,381 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 10:36:44,384 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 10:36:44,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:44,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:44,396 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 10:36:44,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:46 [2018-11-10 10:36:44,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:36:44,407 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 10:36:44,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:44,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:44,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:44,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2018-11-10 10:36:44,460 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:36:44,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-11-10 10:36:44,476 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 10:36:44,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:44,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:44,525 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 10:36:44,528 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 10:36:44,528 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:44,530 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:44,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 56 treesize of output 42 [2018-11-10 10:36:44,557 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:36:44,558 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:36:44,559 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:36:44,559 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:36:44,564 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 10:36:44,564 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 10:36:44,572 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 10:36:44,581 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 10:36:44,581 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:111, output treesize:13 [2018-11-10 10:36:44,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 10:36:44,606 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:36:44,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 10:36:44,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:44,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:44,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 10:36:44,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:36:44,626 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 10:36:44,627 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 10:36:44,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:44,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:44,630 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 10:36:44,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:36:44,755 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 10:36:44,755 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:36:44,838 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 10:36:44,842 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 10:36:44,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:44,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:44,857 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 10:36:44,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:32 [2018-11-10 10:36:44,927 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 10:36:44,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 11 treesize of output 10 [2018-11-10 10:36:44,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:44,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 10 treesize of output 8 [2018-11-10 10:36:44,992 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 10:36:44,992 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:44,996 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:45,007 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 10:36:45,019 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 10:36:45,019 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:10 [2018-11-10 10:36:45,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 10:36:45,058 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 10:36:45,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:45,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:45,064 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 10:36:45,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:10 [2018-11-10 10:36:45,338 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 10:36:45,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:36:45,344 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:36:45,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:36:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:36:45,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:36:45,758 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 10:36:45,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:45,807 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 10:36:45,811 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 10:36:45,811 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:45,816 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:45,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, 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 10:36:45,844 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 10:36:45,848 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:36:45,850 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 10:36:45,854 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:36:45,855 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:36:45,857 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:36:45,862 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 10:36:45,863 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:45,878 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:45,888 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:45,896 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:45,913 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 10:36:45,914 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:48, output treesize:23 [2018-11-10 10:36:46,033 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 10:36:46,037 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 10:36:46,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:46,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:46,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 23 treesize of output 19 [2018-11-10 10:36:46,092 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:36:46,092 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 10:36:46,092 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:46,096 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:46,103 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 10:36:46,103 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:12 [2018-11-10 10:36:46,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:36:46,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 10:36:46,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:46,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:46,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:46,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-10 10:36:46,185 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:36:46,190 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 10:36:46,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-10 10:36:46,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:46,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:46,216 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 10:36:46,218 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:36:46,218 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 10:36:46,219 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 10:36:46,226 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 10:36:46,236 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 10:36:46,236 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:13 [2018-11-10 10:36:46,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 23 treesize of output 18 [2018-11-10 10:36:46,243 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:36:46,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 10:36:46,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:46,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:46,258 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 10:36:46,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:36:46,262 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 10:36:46,263 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 10:36:46,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:46,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:46,265 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 10:36:46,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:36:46,327 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 10:36:46,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:36:46,408 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 10:36:46,446 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 10:36:46,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:46,461 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 10:36:46,464 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 10:36:46,464 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:36:46,466 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:36:46,475 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 10:36:46,485 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 10:36:46,486 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:10 [2018-11-10 10:36:46,809 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 10:36:46,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 10:36:46,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9] total 24 [2018-11-10 10:36:46,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-10 10:36:46,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-10 10:36:46,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2018-11-10 10:36:46,830 INFO L87 Difference]: Start difference. First operand 1245 states and 1935 transitions. Second operand 24 states. [2018-11-10 10:37:01,223 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2018-11-10 10:37:02,981 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2018-11-10 10:37:07,401 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-11-10 10:37:08,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:08,606 INFO L93 Difference]: Finished difference Result 2827 states and 4344 transitions. [2018-11-10 10:37:08,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:37:08,609 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 184 [2018-11-10 10:37:08,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:37:08,610 INFO L225 Difference]: With dead ends: 2827 [2018-11-10 10:37:08,610 INFO L226 Difference]: Without dead ends: 1633 [2018-11-10 10:37:08,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 709 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-11-10 10:37:08,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2018-11-10 10:37:08,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1177. [2018-11-10 10:37:08,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-11-10 10:37:08,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1817 transitions. [2018-11-10 10:37:08,682 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1817 transitions. Word has length 184 [2018-11-10 10:37:08,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:37:08,682 INFO L481 AbstractCegarLoop]: Abstraction has 1177 states and 1817 transitions. [2018-11-10 10:37:08,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-10 10:37:08,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1817 transitions. [2018-11-10 10:37:08,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-10 10:37:08,683 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:37:08,683 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 10:37:08,683 INFO L424 AbstractCegarLoop]: === Iteration 94 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:37:08,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:08,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1300440610, now seen corresponding path program 1 times [2018-11-10 10:37:08,684 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:37:08,684 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:37:08,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:09,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:37:09,564 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 10:37:09,565 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 10:37:09,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:09,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:09,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:09,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:37:09,577 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 10:37:09,579 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 10:37:09,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:09,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:09,583 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 10:37:09,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:37:09,598 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 10:37:09,598 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:37:09,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:37:09,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:37:09,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:37:09,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:37:09,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:37:09,603 INFO L87 Difference]: Start difference. First operand 1177 states and 1817 transitions. Second operand 4 states. [2018-11-10 10:37:12,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:12,097 INFO L93 Difference]: Finished difference Result 2344 states and 3625 transitions. [2018-11-10 10:37:12,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:37:12,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-11-10 10:37:12,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:37:12,099 INFO L225 Difference]: With dead ends: 2344 [2018-11-10 10:37:12,099 INFO L226 Difference]: Without dead ends: 1218 [2018-11-10 10:37:12,100 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 10:37:12,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2018-11-10 10:37:12,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1177. [2018-11-10 10:37:12,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-11-10 10:37:12,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1815 transitions. [2018-11-10 10:37:12,169 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1815 transitions. Word has length 184 [2018-11-10 10:37:12,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:37:12,169 INFO L481 AbstractCegarLoop]: Abstraction has 1177 states and 1815 transitions. [2018-11-10 10:37:12,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:37:12,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1815 transitions. [2018-11-10 10:37:12,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-10 10:37:12,170 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:37:12,170 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 10:37:12,170 INFO L424 AbstractCegarLoop]: === Iteration 95 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:37:12,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:12,171 INFO L82 PathProgramCache]: Analyzing trace with hash -835595406, now seen corresponding path program 1 times [2018-11-10 10:37:12,171 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:37:12,171 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:37:12,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:13,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:37:13,038 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 10:37:13,039 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 10:37:13,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:13,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:13,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:13,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:37:13,067 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 10:37:13,070 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 10:37:13,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:13,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:13,091 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 10:37:13,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:37:13,105 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 10:37:13,106 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:37:13,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:37:13,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:37:13,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:37:13,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:37:13,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:37:13,110 INFO L87 Difference]: Start difference. First operand 1177 states and 1815 transitions. Second operand 4 states. [2018-11-10 10:37:15,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:15,585 INFO L93 Difference]: Finished difference Result 2344 states and 3621 transitions. [2018-11-10 10:37:15,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:37:15,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-11-10 10:37:15,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:37:15,586 INFO L225 Difference]: With dead ends: 2344 [2018-11-10 10:37:15,586 INFO L226 Difference]: Without dead ends: 1218 [2018-11-10 10:37:15,587 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 10:37:15,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2018-11-10 10:37:15,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1177. [2018-11-10 10:37:15,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-11-10 10:37:15,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1813 transitions. [2018-11-10 10:37:15,664 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1813 transitions. Word has length 184 [2018-11-10 10:37:15,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:37:15,664 INFO L481 AbstractCegarLoop]: Abstraction has 1177 states and 1813 transitions. [2018-11-10 10:37:15,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:37:15,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1813 transitions. [2018-11-10 10:37:15,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-10 10:37:15,665 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:37:15,665 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 10:37:15,665 INFO L424 AbstractCegarLoop]: === Iteration 96 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:37:15,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:15,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1789756988, now seen corresponding path program 1 times [2018-11-10 10:37:15,666 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:37:15,666 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:37:15,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:16,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:37:16,550 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 10:37:16,552 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 10:37:16,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:16,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:16,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:16,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:37:16,565 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 10:37:16,566 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 10:37:16,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:16,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:16,568 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 10:37:16,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:37:16,582 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 10:37:16,582 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:37:16,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:37:16,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:37:16,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:37:16,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:37:16,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:37:16,586 INFO L87 Difference]: Start difference. First operand 1177 states and 1813 transitions. Second operand 4 states. [2018-11-10 10:37:19,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:19,049 INFO L93 Difference]: Finished difference Result 2344 states and 3617 transitions. [2018-11-10 10:37:19,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:37:19,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2018-11-10 10:37:19,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:37:19,051 INFO L225 Difference]: With dead ends: 2344 [2018-11-10 10:37:19,051 INFO L226 Difference]: Without dead ends: 1218 [2018-11-10 10:37:19,052 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 10:37:19,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2018-11-10 10:37:19,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1177. [2018-11-10 10:37:19,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-11-10 10:37:19,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1811 transitions. [2018-11-10 10:37:19,121 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1811 transitions. Word has length 185 [2018-11-10 10:37:19,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:37:19,121 INFO L481 AbstractCegarLoop]: Abstraction has 1177 states and 1811 transitions. [2018-11-10 10:37:19,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:37:19,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1811 transitions. [2018-11-10 10:37:19,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-10 10:37:19,122 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:37:19,122 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, 1, 1] [2018-11-10 10:37:19,123 INFO L424 AbstractCegarLoop]: === Iteration 97 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:37:19,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:19,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1818646973, now seen corresponding path program 1 times [2018-11-10 10:37:19,123 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:37:19,123 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:37:19,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:19,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:37:19,991 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 10:37:19,993 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 10:37:19,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:19,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:19,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:20,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:37:20,007 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 10:37:20,009 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 10:37:20,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:20,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:20,014 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 10:37:20,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:37:20,038 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 10:37:20,038 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:37:20,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:37:20,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:37:20,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:37:20,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:37:20,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:37:20,042 INFO L87 Difference]: Start difference. First operand 1177 states and 1811 transitions. Second operand 4 states. [2018-11-10 10:37:22,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:22,679 INFO L93 Difference]: Finished difference Result 2411 states and 3701 transitions. [2018-11-10 10:37:22,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:37:22,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2018-11-10 10:37:22,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:37:22,681 INFO L225 Difference]: With dead ends: 2411 [2018-11-10 10:37:22,681 INFO L226 Difference]: Without dead ends: 1285 [2018-11-10 10:37:22,682 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 10:37:22,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2018-11-10 10:37:22,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1177. [2018-11-10 10:37:22,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-11-10 10:37:22,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1809 transitions. [2018-11-10 10:37:22,753 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1809 transitions. Word has length 185 [2018-11-10 10:37:22,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:37:22,754 INFO L481 AbstractCegarLoop]: Abstraction has 1177 states and 1809 transitions. [2018-11-10 10:37:22,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:37:22,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1809 transitions. [2018-11-10 10:37:22,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-10 10:37:22,755 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:37:22,755 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 10:37:22,755 INFO L424 AbstractCegarLoop]: === Iteration 98 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:37:22,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:22,755 INFO L82 PathProgramCache]: Analyzing trace with hash -637469897, now seen corresponding path program 1 times [2018-11-10 10:37:22,756 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:37:22,756 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:37:22,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:23,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:37:23,633 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 10:37:23,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:37:23,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:23,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:23,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:23,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:37:23,645 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 10:37:23,652 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 10:37:23,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:23,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:23,661 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 10:37:23,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:37:23,675 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 10:37:23,675 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:37:23,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:37:23,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:37:23,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:37:23,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:37:23,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:37:23,679 INFO L87 Difference]: Start difference. First operand 1177 states and 1809 transitions. Second operand 4 states. [2018-11-10 10:37:26,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:26,174 INFO L93 Difference]: Finished difference Result 2344 states and 3609 transitions. [2018-11-10 10:37:26,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:37:26,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2018-11-10 10:37:26,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:37:26,176 INFO L225 Difference]: With dead ends: 2344 [2018-11-10 10:37:26,176 INFO L226 Difference]: Without dead ends: 1218 [2018-11-10 10:37:26,177 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 10:37:26,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2018-11-10 10:37:26,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1177. [2018-11-10 10:37:26,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-11-10 10:37:26,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1807 transitions. [2018-11-10 10:37:26,248 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1807 transitions. Word has length 186 [2018-11-10 10:37:26,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:37:26,248 INFO L481 AbstractCegarLoop]: Abstraction has 1177 states and 1807 transitions. [2018-11-10 10:37:26,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:37:26,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1807 transitions. [2018-11-10 10:37:26,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-10 10:37:26,249 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:37:26,249 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, 1, 1] [2018-11-10 10:37:26,249 INFO L424 AbstractCegarLoop]: === Iteration 99 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:37:26,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:26,249 INFO L82 PathProgramCache]: Analyzing trace with hash -364683994, now seen corresponding path program 1 times [2018-11-10 10:37:26,250 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:37:26,250 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:37:26,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:27,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:37:27,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:37:27,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 10:37:27,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:27,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:27,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:27,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:37:27,152 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 10:37:27,155 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 10:37:27,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:27,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:27,164 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 10:37:27,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:37:27,178 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 10:37:27,178 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:37:27,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:37:27,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:37:27,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:37:27,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:37:27,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:37:27,182 INFO L87 Difference]: Start difference. First operand 1177 states and 1807 transitions. Second operand 4 states. [2018-11-10 10:37:29,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:29,794 INFO L93 Difference]: Finished difference Result 2391 states and 3669 transitions. [2018-11-10 10:37:29,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:37:29,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2018-11-10 10:37:29,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:37:29,796 INFO L225 Difference]: With dead ends: 2391 [2018-11-10 10:37:29,796 INFO L226 Difference]: Without dead ends: 1265 [2018-11-10 10:37:29,796 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 10:37:29,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2018-11-10 10:37:29,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1177. [2018-11-10 10:37:29,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-11-10 10:37:29,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1805 transitions. [2018-11-10 10:37:29,866 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1805 transitions. Word has length 186 [2018-11-10 10:37:29,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:37:29,866 INFO L481 AbstractCegarLoop]: Abstraction has 1177 states and 1805 transitions. [2018-11-10 10:37:29,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:37:29,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1805 transitions. [2018-11-10 10:37:29,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-10 10:37:29,867 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:37:29,867 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, 1, 1] [2018-11-10 10:37:29,868 INFO L424 AbstractCegarLoop]: === Iteration 100 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:37:29,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:29,868 INFO L82 PathProgramCache]: Analyzing trace with hash 100161210, now seen corresponding path program 1 times [2018-11-10 10:37:29,868 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:37:29,868 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:37:29,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:30,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:37:30,755 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 10:37:30,757 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 10:37:30,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:30,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:30,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:30,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:37:30,768 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 10:37:30,769 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 10:37:30,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:30,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:30,771 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 10:37:30,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:37:30,784 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 10:37:30,785 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:37:30,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:37:30,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:37:30,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:37:30,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:37:30,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:37:30,789 INFO L87 Difference]: Start difference. First operand 1177 states and 1805 transitions. Second operand 4 states. [2018-11-10 10:37:33,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:33,417 INFO L93 Difference]: Finished difference Result 2391 states and 3665 transitions. [2018-11-10 10:37:33,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:37:33,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2018-11-10 10:37:33,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:37:33,419 INFO L225 Difference]: With dead ends: 2391 [2018-11-10 10:37:33,419 INFO L226 Difference]: Without dead ends: 1265 [2018-11-10 10:37:33,420 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 10:37:33,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2018-11-10 10:37:33,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1177. [2018-11-10 10:37:33,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-11-10 10:37:33,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1803 transitions. [2018-11-10 10:37:33,498 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1803 transitions. Word has length 186 [2018-11-10 10:37:33,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:37:33,499 INFO L481 AbstractCegarLoop]: Abstraction has 1177 states and 1803 transitions. [2018-11-10 10:37:33,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:37:33,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1803 transitions. [2018-11-10 10:37:33,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-10 10:37:33,500 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:37:33,500 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, 1, 1] [2018-11-10 10:37:33,501 INFO L424 AbstractCegarLoop]: === Iteration 101 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:37:33,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:33,501 INFO L82 PathProgramCache]: Analyzing trace with hash 284926883, now seen corresponding path program 1 times [2018-11-10 10:37:33,501 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:37:33,502 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:37:33,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:34,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:37:34,373 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 10:37:34,375 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 10:37:34,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:34,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:34,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:34,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:37:34,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 10:37:34,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 15 treesize of output 3 [2018-11-10 10:37:34,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:34,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:34,391 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 10:37:34,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:37:34,408 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 10:37:34,408 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:37:34,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:37:34,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:37:34,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:37:34,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:37:34,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:37:34,412 INFO L87 Difference]: Start difference. First operand 1177 states and 1803 transitions. Second operand 4 states. [2018-11-10 10:37:37,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:37,020 INFO L93 Difference]: Finished difference Result 2387 states and 3657 transitions. [2018-11-10 10:37:37,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:37:37,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2018-11-10 10:37:37,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:37:37,022 INFO L225 Difference]: With dead ends: 2387 [2018-11-10 10:37:37,022 INFO L226 Difference]: Without dead ends: 1261 [2018-11-10 10:37:37,023 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 10:37:37,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2018-11-10 10:37:37,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1177. [2018-11-10 10:37:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-11-10 10:37:37,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1801 transitions. [2018-11-10 10:37:37,098 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1801 transitions. Word has length 186 [2018-11-10 10:37:37,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:37:37,098 INFO L481 AbstractCegarLoop]: Abstraction has 1177 states and 1801 transitions. [2018-11-10 10:37:37,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:37:37,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1801 transitions. [2018-11-10 10:37:37,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-10 10:37:37,100 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:37:37,100 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 10:37:37,100 INFO L424 AbstractCegarLoop]: === Iteration 102 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:37:37,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:37,100 INFO L82 PathProgramCache]: Analyzing trace with hash -780864479, now seen corresponding path program 1 times [2018-11-10 10:37:37,101 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:37:37,101 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:37:37,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:37,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:37:38,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 13 treesize of output 10 [2018-11-10 10:37:38,005 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 10:37:38,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:38,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:38,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:38,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:37:38,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 10:37:38,016 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 10:37:38,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:38,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:38,023 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 10:37:38,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:37:38,037 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 10:37:38,037 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:37:38,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:37:38,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:37:38,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:37:38,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:37:38,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:37:38,042 INFO L87 Difference]: Start difference. First operand 1177 states and 1801 transitions. Second operand 4 states. [2018-11-10 10:37:40,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:40,487 INFO L93 Difference]: Finished difference Result 2324 states and 3567 transitions. [2018-11-10 10:37:40,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:37:40,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2018-11-10 10:37:40,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:37:40,489 INFO L225 Difference]: With dead ends: 2324 [2018-11-10 10:37:40,489 INFO L226 Difference]: Without dead ends: 1198 [2018-11-10 10:37:40,490 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 10:37:40,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2018-11-10 10:37:40,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1145. [2018-11-10 10:37:40,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2018-11-10 10:37:40,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1757 transitions. [2018-11-10 10:37:40,566 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1757 transitions. Word has length 187 [2018-11-10 10:37:40,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:37:40,566 INFO L481 AbstractCegarLoop]: Abstraction has 1145 states and 1757 transitions. [2018-11-10 10:37:40,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:37:40,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1757 transitions. [2018-11-10 10:37:40,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-10 10:37:40,567 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:37:40,567 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, 1, 1] [2018-11-10 10:37:40,567 INFO L424 AbstractCegarLoop]: === Iteration 103 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:37:40,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:40,568 INFO L82 PathProgramCache]: Analyzing trace with hash 733441012, now seen corresponding path program 1 times [2018-11-10 10:37:40,568 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:37:40,569 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:37:40,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:41,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:37:41,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 13 treesize of output 10 [2018-11-10 10:37:41,477 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 10:37:41,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:41,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:41,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:41,484 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:37:41,494 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 10:37:41,496 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 10:37:41,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:41,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:41,498 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 10:37:41,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:37:41,512 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 10:37:41,512 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:37:41,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:37:41,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:37:41,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:37:41,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:37:41,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:37:41,517 INFO L87 Difference]: Start difference. First operand 1145 states and 1757 transitions. Second operand 4 states. [2018-11-10 10:37:44,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:44,129 INFO L93 Difference]: Finished difference Result 2323 states and 3565 transitions. [2018-11-10 10:37:44,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:37:44,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2018-11-10 10:37:44,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:37:44,130 INFO L225 Difference]: With dead ends: 2323 [2018-11-10 10:37:44,130 INFO L226 Difference]: Without dead ends: 1229 [2018-11-10 10:37:44,131 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 10:37:44,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2018-11-10 10:37:44,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1145. [2018-11-10 10:37:44,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2018-11-10 10:37:44,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1755 transitions. [2018-11-10 10:37:44,206 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1755 transitions. Word has length 187 [2018-11-10 10:37:44,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:37:44,207 INFO L481 AbstractCegarLoop]: Abstraction has 1145 states and 1755 transitions. [2018-11-10 10:37:44,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:37:44,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1755 transitions. [2018-11-10 10:37:44,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-10 10:37:44,208 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:37:44,208 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, 1, 1] [2018-11-10 10:37:44,208 INFO L424 AbstractCegarLoop]: === Iteration 104 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:37:44,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:44,208 INFO L82 PathProgramCache]: Analyzing trace with hash 976473215, now seen corresponding path program 1 times [2018-11-10 10:37:44,209 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:37:44,209 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:37:44,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:45,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:37:45,102 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 10:37:45,103 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 10:37:45,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:45,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:45,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:45,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:37:45,115 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 10:37:45,117 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 10:37:45,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:45,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:45,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 10:37:45,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:37:45,133 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 10:37:45,133 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:37:45,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:37:45,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:37:45,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:37:45,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:37:45,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:37:45,137 INFO L87 Difference]: Start difference. First operand 1145 states and 1755 transitions. Second operand 4 states. [2018-11-10 10:37:47,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:47,744 INFO L93 Difference]: Finished difference Result 2323 states and 3561 transitions. [2018-11-10 10:37:47,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:37:47,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-11-10 10:37:47,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:37:47,746 INFO L225 Difference]: With dead ends: 2323 [2018-11-10 10:37:47,746 INFO L226 Difference]: Without dead ends: 1229 [2018-11-10 10:37:47,747 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 10:37:47,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2018-11-10 10:37:47,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1145. [2018-11-10 10:37:47,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2018-11-10 10:37:47,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1753 transitions. [2018-11-10 10:37:47,818 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1753 transitions. Word has length 188 [2018-11-10 10:37:47,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:37:47,818 INFO L481 AbstractCegarLoop]: Abstraction has 1145 states and 1753 transitions. [2018-11-10 10:37:47,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:37:47,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1753 transitions. [2018-11-10 10:37:47,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-10 10:37:47,819 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:37:47,819 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, 1, 1] [2018-11-10 10:37:47,819 INFO L424 AbstractCegarLoop]: === Iteration 105 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:37:47,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:47,819 INFO L82 PathProgramCache]: Analyzing trace with hash 2006731737, now seen corresponding path program 1 times [2018-11-10 10:37:47,820 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:37:47,820 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:37:47,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:48,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:37:48,721 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 10:37:48,722 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 10:37:48,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:48,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:48,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:48,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:37:48,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 19 treesize of output 15 [2018-11-10 10:37:48,737 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 10:37:48,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:48,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:48,743 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 10:37:48,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:37:48,756 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 10:37:48,756 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:37:48,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:37:48,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:37:48,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:37:48,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:37:48,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:37:48,762 INFO L87 Difference]: Start difference. First operand 1145 states and 1753 transitions. Second operand 4 states. [2018-11-10 10:37:51,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:51,344 INFO L93 Difference]: Finished difference Result 2303 states and 3531 transitions. [2018-11-10 10:37:51,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:37:51,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2018-11-10 10:37:51,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:37:51,345 INFO L225 Difference]: With dead ends: 2303 [2018-11-10 10:37:51,346 INFO L226 Difference]: Without dead ends: 1209 [2018-11-10 10:37:51,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 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 10:37:51,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2018-11-10 10:37:51,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1145. [2018-11-10 10:37:51,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2018-11-10 10:37:51,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1751 transitions. [2018-11-10 10:37:51,430 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1751 transitions. Word has length 189 [2018-11-10 10:37:51,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:37:51,430 INFO L481 AbstractCegarLoop]: Abstraction has 1145 states and 1751 transitions. [2018-11-10 10:37:51,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:37:51,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1751 transitions. [2018-11-10 10:37:51,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-10 10:37:51,431 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:37:51,431 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, 1, 1] [2018-11-10 10:37:51,431 INFO L424 AbstractCegarLoop]: === Iteration 106 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:37:51,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:51,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1489985562, now seen corresponding path program 1 times [2018-11-10 10:37:51,432 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:37:51,432 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:37:51,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:52,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:37:52,332 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 10:37:52,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:37:52,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:52,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:52,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:52,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:37:52,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 10:37:52,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 10:37:52,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:52,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:52,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 10:37:52,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:37:52,363 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 10:37:52,363 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:37:52,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:37:52,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:37:52,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:37:52,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:37:52,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:37:52,367 INFO L87 Difference]: Start difference. First operand 1145 states and 1751 transitions. Second operand 4 states. [2018-11-10 10:37:54,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:54,959 INFO L93 Difference]: Finished difference Result 2303 states and 3527 transitions. [2018-11-10 10:37:54,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:37:54,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2018-11-10 10:37:54,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:37:54,961 INFO L225 Difference]: With dead ends: 2303 [2018-11-10 10:37:54,961 INFO L226 Difference]: Without dead ends: 1209 [2018-11-10 10:37:54,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 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 10:37:54,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2018-11-10 10:37:55,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1145. [2018-11-10 10:37:55,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2018-11-10 10:37:55,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1749 transitions. [2018-11-10 10:37:55,039 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1749 transitions. Word has length 189 [2018-11-10 10:37:55,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:37:55,039 INFO L481 AbstractCegarLoop]: Abstraction has 1145 states and 1749 transitions. [2018-11-10 10:37:55,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:37:55,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1749 transitions. [2018-11-10 10:37:55,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-10 10:37:55,040 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:37:55,040 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, 1, 1] [2018-11-10 10:37:55,040 INFO L424 AbstractCegarLoop]: === Iteration 107 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:37:55,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:55,041 INFO L82 PathProgramCache]: Analyzing trace with hash 460211104, now seen corresponding path program 1 times [2018-11-10 10:37:55,041 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:37:55,041 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:37:55,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:55,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:37:55,944 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 10:37:55,948 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 10:37:55,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:55,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:55,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:55,958 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:37:55,964 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 10:37:55,965 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 10:37:55,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:37:55,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:37:55,968 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 10:37:55,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:37:55,986 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 10:37:55,986 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:37:55,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:37:55,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:37:55,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:37:55,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:37:55,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:37:55,990 INFO L87 Difference]: Start difference. First operand 1145 states and 1749 transitions. Second operand 4 states. [2018-11-10 10:37:58,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:58,521 INFO L93 Difference]: Finished difference Result 2287 states and 3497 transitions. [2018-11-10 10:37:58,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:37:58,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2018-11-10 10:37:58,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:37:58,523 INFO L225 Difference]: With dead ends: 2287 [2018-11-10 10:37:58,523 INFO L226 Difference]: Without dead ends: 1193 [2018-11-10 10:37:58,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 187 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 10:37:58,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2018-11-10 10:37:58,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1145. [2018-11-10 10:37:58,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2018-11-10 10:37:58,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1747 transitions. [2018-11-10 10:37:58,599 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1747 transitions. Word has length 190 [2018-11-10 10:37:58,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:37:58,599 INFO L481 AbstractCegarLoop]: Abstraction has 1145 states and 1747 transitions. [2018-11-10 10:37:58,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:37:58,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1747 transitions. [2018-11-10 10:37:58,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-10 10:37:58,600 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:37:58,600 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, 1, 1, 1, 1] [2018-11-10 10:37:58,600 INFO L424 AbstractCegarLoop]: === Iteration 108 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:37:58,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:58,600 INFO L82 PathProgramCache]: Analyzing trace with hash -979638619, now seen corresponding path program 1 times [2018-11-10 10:37:58,601 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:37:58,601 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:37:58,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:38:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:38:00,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:38:00,461 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 10:38:00,463 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 10:38:00,466 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:38:00,468 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 10:38:00,468 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:00,474 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:00,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:00,487 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 10:38:00,487 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:38:00,499 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 10:38:00,500 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 10:38:00,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:00,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:00,503 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 10:38:00,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:38:00,534 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 10:38:00,534 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:38:00,554 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 10:38:00,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:00,554 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 10:38:00,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 10:38:00,570 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 10:38:00,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:38:00,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 10:38:00,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:38:00,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:38:00,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:38:00,575 INFO L87 Difference]: Start difference. First operand 1145 states and 1747 transitions. Second operand 9 states. [2018-11-10 10:38:03,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:38:03,896 INFO L93 Difference]: Finished difference Result 2663 states and 4030 transitions. [2018-11-10 10:38:03,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:38:03,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 195 [2018-11-10 10:38:03,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:38:03,897 INFO L225 Difference]: With dead ends: 2663 [2018-11-10 10:38:03,898 INFO L226 Difference]: Without dead ends: 1569 [2018-11-10 10:38:03,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 385 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 10:38:03,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2018-11-10 10:38:03,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1145. [2018-11-10 10:38:03,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2018-11-10 10:38:03,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1739 transitions. [2018-11-10 10:38:03,980 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1739 transitions. Word has length 195 [2018-11-10 10:38:03,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:38:03,980 INFO L481 AbstractCegarLoop]: Abstraction has 1145 states and 1739 transitions. [2018-11-10 10:38:03,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:38:03,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1739 transitions. [2018-11-10 10:38:03,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-10 10:38:03,981 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:38:03,981 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, 1, 1, 1, 1] [2018-11-10 10:38:03,981 INFO L424 AbstractCegarLoop]: === Iteration 109 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:38:03,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:38:03,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1212191426, now seen corresponding path program 1 times [2018-11-10 10:38:03,982 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:38:03,982 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:38:04,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:38:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:38:05,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:38:05,900 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 10:38:05,902 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 10:38:05,905 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:38:05,907 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 10:38:05,907 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:05,913 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:05,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:05,925 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 10:38:05,925 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:38:05,936 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 10:38:05,937 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 10:38:05,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:05,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:05,942 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 10:38:05,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:38:05,963 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 10:38:05,963 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:38:05,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:38:05,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:38:05,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:38:05,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:38:05,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:38:05,968 INFO L87 Difference]: Start difference. First operand 1145 states and 1739 transitions. Second operand 7 states. [2018-11-10 10:38:06,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:38:06,922 INFO L93 Difference]: Finished difference Result 2443 states and 3717 transitions. [2018-11-10 10:38:06,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:38:06,923 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 196 [2018-11-10 10:38:06,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:38:06,924 INFO L225 Difference]: With dead ends: 2443 [2018-11-10 10:38:06,924 INFO L226 Difference]: Without dead ends: 1349 [2018-11-10 10:38:06,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 190 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 10:38:06,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2018-11-10 10:38:07,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1169. [2018-11-10 10:38:07,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1169 states. [2018-11-10 10:38:07,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1773 transitions. [2018-11-10 10:38:07,008 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1773 transitions. Word has length 196 [2018-11-10 10:38:07,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:38:07,008 INFO L481 AbstractCegarLoop]: Abstraction has 1169 states and 1773 transitions. [2018-11-10 10:38:07,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:38:07,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1773 transitions. [2018-11-10 10:38:07,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-10 10:38:07,009 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:38:07,009 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, 1, 1, 1, 1] [2018-11-10 10:38:07,009 INFO L424 AbstractCegarLoop]: === Iteration 110 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:38:07,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:38:07,009 INFO L82 PathProgramCache]: Analyzing trace with hash -747346222, now seen corresponding path program 1 times [2018-11-10 10:38:07,010 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:38:07,010 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:38:07,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:38:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:38:08,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:38:08,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 18 treesize of output 15 [2018-11-10 10:38:08,927 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 10:38:08,929 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:38:08,931 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 10:38:08,931 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:08,938 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:08,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:08,952 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 10:38:08,952 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:38:08,966 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 10:38:08,968 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 10:38:08,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:08,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:08,974 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 10:38:08,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:38:08,998 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 10:38:08,998 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:38:09,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:38:09,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:38:09,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:38:09,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:38:09,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:38:09,003 INFO L87 Difference]: Start difference. First operand 1169 states and 1773 transitions. Second operand 7 states. [2018-11-10 10:38:11,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:38:11,971 INFO L93 Difference]: Finished difference Result 2467 states and 3749 transitions. [2018-11-10 10:38:11,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:38:11,972 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 196 [2018-11-10 10:38:11,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:38:11,973 INFO L225 Difference]: With dead ends: 2467 [2018-11-10 10:38:11,973 INFO L226 Difference]: Without dead ends: 1349 [2018-11-10 10:38:11,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 190 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 10:38:11,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2018-11-10 10:38:12,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1171. [2018-11-10 10:38:12,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1171 states. [2018-11-10 10:38:12,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1775 transitions. [2018-11-10 10:38:12,057 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1775 transitions. Word has length 196 [2018-11-10 10:38:12,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:38:12,057 INFO L481 AbstractCegarLoop]: Abstraction has 1171 states and 1775 transitions. [2018-11-10 10:38:12,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:38:12,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1775 transitions. [2018-11-10 10:38:12,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-10 10:38:12,058 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:38:12,058 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, 1, 1, 1, 1] [2018-11-10 10:38:12,058 INFO L424 AbstractCegarLoop]: === Iteration 111 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:38:12,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:38:12,058 INFO L82 PathProgramCache]: Analyzing trace with hash -562580549, now seen corresponding path program 1 times [2018-11-10 10:38:12,058 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:38:12,058 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:38:12,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:38:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:38:13,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:38:13,885 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 10:38:13,887 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 10:38:13,890 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:38:13,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 10:38:13,893 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:13,900 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:13,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:13,913 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 10:38:13,913 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:38:13,926 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 10:38:13,929 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 10:38:13,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:13,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:13,939 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 10:38:13,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:38:13,974 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 10:38:13,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:38:13,994 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 10:38:13,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:13,995 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 10:38:13,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-10 10:38:14,011 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 10:38:14,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:38:14,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 10:38:14,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:38:14,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:38:14,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:38:14,016 INFO L87 Difference]: Start difference. First operand 1171 states and 1775 transitions. Second operand 9 states. [2018-11-10 10:38:17,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:38:17,495 INFO L93 Difference]: Finished difference Result 2665 states and 4016 transitions. [2018-11-10 10:38:17,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:38:17,496 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 196 [2018-11-10 10:38:17,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:38:17,497 INFO L225 Difference]: With dead ends: 2665 [2018-11-10 10:38:17,497 INFO L226 Difference]: Without dead ends: 1545 [2018-11-10 10:38:17,498 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 10:38:17,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2018-11-10 10:38:17,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1171. [2018-11-10 10:38:17,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1171 states. [2018-11-10 10:38:17,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1767 transitions. [2018-11-10 10:38:17,582 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1767 transitions. Word has length 196 [2018-11-10 10:38:17,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:38:17,582 INFO L481 AbstractCegarLoop]: Abstraction has 1171 states and 1767 transitions. [2018-11-10 10:38:17,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:38:17,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1767 transitions. [2018-11-10 10:38:17,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-10 10:38:17,584 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:38:17,584 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, 1, 1, 1, 1] [2018-11-10 10:38:17,584 INFO L424 AbstractCegarLoop]: === Iteration 112 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:38:17,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:38:17,584 INFO L82 PathProgramCache]: Analyzing trace with hash 230514396, now seen corresponding path program 1 times [2018-11-10 10:38:17,585 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:38:17,585 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:38:17,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:38:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:38:19,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:38:19,523 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 10:38:19,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:38:19,528 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:38:19,530 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 10:38:19,530 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:19,535 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:19,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:19,547 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 10:38:19,547 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:38:19,558 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 10:38:19,559 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 10:38:19,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:19,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:19,564 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 10:38:19,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:38:19,592 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 10:38:19,592 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:38:19,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:38:19,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:38:19,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:38:19,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:38:19,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:38:19,597 INFO L87 Difference]: Start difference. First operand 1171 states and 1767 transitions. Second operand 7 states. [2018-11-10 10:38:22,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:38:22,577 INFO L93 Difference]: Finished difference Result 2465 states and 3727 transitions. [2018-11-10 10:38:22,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:38:22,577 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 197 [2018-11-10 10:38:22,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:38:22,578 INFO L225 Difference]: With dead ends: 2465 [2018-11-10 10:38:22,578 INFO L226 Difference]: Without dead ends: 1345 [2018-11-10 10:38:22,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 191 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 10:38:22,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2018-11-10 10:38:22,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1173. [2018-11-10 10:38:22,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2018-11-10 10:38:22,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1769 transitions. [2018-11-10 10:38:22,669 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1769 transitions. Word has length 197 [2018-11-10 10:38:22,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:38:22,669 INFO L481 AbstractCegarLoop]: Abstraction has 1173 states and 1769 transitions. [2018-11-10 10:38:22,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:38:22,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1769 transitions. [2018-11-10 10:38:22,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-10 10:38:22,670 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:38:22,670 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, 1, 1] [2018-11-10 10:38:22,670 INFO L424 AbstractCegarLoop]: === Iteration 113 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:38:22,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:38:22,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1365092667, now seen corresponding path program 1 times [2018-11-10 10:38:22,671 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:38:22,671 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:38:22,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:38:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:38:24,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:38:24,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 13 treesize of output 10 [2018-11-10 10:38:24,358 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 10:38:24,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:24,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:24,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:24,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:38:24,381 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 10:38:24,384 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:38:24,386 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 10:38:24,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:24,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:24,400 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 10:38:24,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:38:24,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 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 10:38:24,411 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 10:38:24,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:24,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:24,413 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 10:38:24,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:38:24,450 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 10:38:24,450 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:38:24,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:38:24,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:38:24,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:38:24,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:38:24,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:38:24,456 INFO L87 Difference]: Start difference. First operand 1173 states and 1769 transitions. Second operand 7 states. [2018-11-10 10:38:27,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:38:27,306 INFO L93 Difference]: Finished difference Result 2347 states and 3542 transitions. [2018-11-10 10:38:27,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:38:27,307 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 197 [2018-11-10 10:38:27,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:38:27,307 INFO L225 Difference]: With dead ends: 2347 [2018-11-10 10:38:27,308 INFO L226 Difference]: Without dead ends: 1225 [2018-11-10 10:38:27,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 191 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 10:38:27,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2018-11-10 10:38:27,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1173. [2018-11-10 10:38:27,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2018-11-10 10:38:27,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1767 transitions. [2018-11-10 10:38:27,389 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1767 transitions. Word has length 197 [2018-11-10 10:38:27,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:38:27,389 INFO L481 AbstractCegarLoop]: Abstraction has 1173 states and 1767 transitions. [2018-11-10 10:38:27,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:38:27,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1767 transitions. [2018-11-10 10:38:27,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-10 10:38:27,390 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:38:27,390 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, 1, 1] [2018-11-10 10:38:27,390 INFO L424 AbstractCegarLoop]: === Iteration 114 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:38:27,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:38:27,390 INFO L82 PathProgramCache]: Analyzing trace with hash -21817396, now seen corresponding path program 1 times [2018-11-10 10:38:27,391 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:38:27,391 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:38:27,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:38:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:38:29,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:38:29,104 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 10:38:29,105 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 10:38:29,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:29,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:29,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:29,111 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:38:29,125 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 10:38:29,128 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:38:29,130 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 10:38:29,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:29,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:29,144 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 10:38:29,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:38:29,148 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 10:38:29,149 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 10:38:29,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:29,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:29,151 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 10:38:29,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:38:29,182 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 10:38:29,182 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:38:29,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:38:29,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:38:29,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:38:29,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:38:29,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:38:29,188 INFO L87 Difference]: Start difference. First operand 1173 states and 1767 transitions. Second operand 7 states. [2018-11-10 10:38:32,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:38:32,012 INFO L93 Difference]: Finished difference Result 2335 states and 3522 transitions. [2018-11-10 10:38:32,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:38:32,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 198 [2018-11-10 10:38:32,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:38:32,013 INFO L225 Difference]: With dead ends: 2335 [2018-11-10 10:38:32,014 INFO L226 Difference]: Without dead ends: 1213 [2018-11-10 10:38:32,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 192 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 10:38:32,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2018-11-10 10:38:32,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1173. [2018-11-10 10:38:32,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2018-11-10 10:38:32,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1765 transitions. [2018-11-10 10:38:32,099 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1765 transitions. Word has length 198 [2018-11-10 10:38:32,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:38:32,099 INFO L481 AbstractCegarLoop]: Abstraction has 1173 states and 1765 transitions. [2018-11-10 10:38:32,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:38:32,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1765 transitions. [2018-11-10 10:38:32,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-10 10:38:32,100 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:38:32,100 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, 1, 1, 1, 1] [2018-11-10 10:38:32,101 INFO L424 AbstractCegarLoop]: === Iteration 115 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:38:32,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:38:32,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1729349993, now seen corresponding path program 1 times [2018-11-10 10:38:32,102 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:38:32,102 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:38:32,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:38:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:38:34,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:38:34,048 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 10:38:34,050 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 10:38:34,055 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:38:34,057 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 10:38:34,057 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:34,063 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:34,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:34,077 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 10:38:34,077 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:38:34,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 10:38:34,090 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 10:38:34,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:34,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:34,094 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 10:38:34,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:38:34,117 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 10:38:34,118 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:38:34,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:38:34,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:38:34,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:38:34,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:38:34,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:38:34,123 INFO L87 Difference]: Start difference. First operand 1173 states and 1765 transitions. Second operand 7 states. [2018-11-10 10:38:37,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:38:37,114 INFO L93 Difference]: Finished difference Result 2467 states and 3719 transitions. [2018-11-10 10:38:37,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:38:37,114 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 198 [2018-11-10 10:38:37,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:38:37,115 INFO L225 Difference]: With dead ends: 2467 [2018-11-10 10:38:37,115 INFO L226 Difference]: Without dead ends: 1345 [2018-11-10 10:38:37,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 192 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 10:38:37,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2018-11-10 10:38:37,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1175. [2018-11-10 10:38:37,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1175 states. [2018-11-10 10:38:37,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1767 transitions. [2018-11-10 10:38:37,197 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1767 transitions. Word has length 198 [2018-11-10 10:38:37,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:38:37,197 INFO L481 AbstractCegarLoop]: Abstraction has 1175 states and 1767 transitions. [2018-11-10 10:38:37,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:38:37,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1767 transitions. [2018-11-10 10:38:37,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-10 10:38:37,198 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:38:37,198 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, 1, 1, 1, 1] [2018-11-10 10:38:37,198 INFO L424 AbstractCegarLoop]: === Iteration 116 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:38:37,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:38:37,198 INFO L82 PathProgramCache]: Analyzing trace with hash -269409087, now seen corresponding path program 1 times [2018-11-10 10:38:37,199 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:38:37,199 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:38:37,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:38:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:38:39,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:38:39,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 18 treesize of output 15 [2018-11-10 10:38:39,159 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 10:38:39,163 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:38:39,165 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 10:38:39,165 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:39,171 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:39,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:39,183 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 10:38:39,183 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:38:39,195 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 10:38:39,196 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 10:38:39,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:39,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:39,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 10:38:39,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:38:39,230 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 10:38:39,230 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:38:39,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:38:39,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:38:39,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:38:39,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:38:39,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:38:39,234 INFO L87 Difference]: Start difference. First operand 1175 states and 1767 transitions. Second operand 7 states. [2018-11-10 10:38:40,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:38:40,167 INFO L93 Difference]: Finished difference Result 2449 states and 3693 transitions. [2018-11-10 10:38:40,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:38:40,167 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 199 [2018-11-10 10:38:40,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:38:40,168 INFO L225 Difference]: With dead ends: 2449 [2018-11-10 10:38:40,168 INFO L226 Difference]: Without dead ends: 1325 [2018-11-10 10:38:40,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 193 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 10:38:40,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2018-11-10 10:38:40,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1177. [2018-11-10 10:38:40,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-11-10 10:38:40,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1769 transitions. [2018-11-10 10:38:40,251 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1769 transitions. Word has length 199 [2018-11-10 10:38:40,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:38:40,251 INFO L481 AbstractCegarLoop]: Abstraction has 1177 states and 1769 transitions. [2018-11-10 10:38:40,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:38:40,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1769 transitions. [2018-11-10 10:38:40,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-10 10:38:40,252 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:38:40,252 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, 1, 1, 1, 1] [2018-11-10 10:38:40,252 INFO L424 AbstractCegarLoop]: === Iteration 117 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:38:40,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:38:40,252 INFO L82 PathProgramCache]: Analyzing trace with hash -786155262, now seen corresponding path program 1 times [2018-11-10 10:38:40,253 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:38:40,253 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:38:40,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:38:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:38:42,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:38:42,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 18 treesize of output 15 [2018-11-10 10:38:42,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:38:42,237 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:38:42,238 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 10:38:42,238 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:42,244 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:42,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:42,256 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 10:38:42,256 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:38:42,269 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 10:38:42,270 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 10:38:42,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:42,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:42,272 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 10:38:42,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:38:42,303 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 10:38:42,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:38:42,330 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 10:38:42,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:42,331 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 10:38:42,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-10 10:38:42,347 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 10:38:42,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:38:42,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 10:38:42,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:38:42,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:38:42,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:38:42,352 INFO L87 Difference]: Start difference. First operand 1177 states and 1769 transitions. Second operand 9 states. [2018-11-10 10:38:45,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:38:45,703 INFO L93 Difference]: Finished difference Result 2733 states and 4098 transitions. [2018-11-10 10:38:45,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:38:45,704 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 199 [2018-11-10 10:38:45,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:38:45,705 INFO L225 Difference]: With dead ends: 2733 [2018-11-10 10:38:45,705 INFO L226 Difference]: Without dead ends: 1607 [2018-11-10 10:38:45,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 393 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 10:38:45,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2018-11-10 10:38:45,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1235. [2018-11-10 10:38:45,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2018-11-10 10:38:45,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1859 transitions. [2018-11-10 10:38:45,798 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1859 transitions. Word has length 199 [2018-11-10 10:38:45,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:38:45,798 INFO L481 AbstractCegarLoop]: Abstraction has 1235 states and 1859 transitions. [2018-11-10 10:38:45,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:38:45,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1859 transitions. [2018-11-10 10:38:45,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-10 10:38:45,799 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:38:45,799 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, 1, 1, 1, 1] [2018-11-10 10:38:45,799 INFO L424 AbstractCegarLoop]: === Iteration 118 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:38:45,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:38:45,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1380677704, now seen corresponding path program 1 times [2018-11-10 10:38:45,800 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:38:45,800 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:38:45,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:38:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:38:47,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:38:47,784 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 10:38:47,785 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 10:38:47,788 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:38:47,790 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 10:38:47,790 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:47,796 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:47,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:47,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 10:38:47,807 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:38:47,819 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 10:38:47,820 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 10:38:47,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:47,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:47,823 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 10:38:47,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:38:47,847 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 10:38:47,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:38:47,868 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 10:38:47,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:47,868 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 10:38:47,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 10:38:47,884 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 10:38:47,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:38:47,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 10:38:47,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:38:47,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:38:47,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:38:47,889 INFO L87 Difference]: Start difference. First operand 1235 states and 1859 transitions. Second operand 9 states. [2018-11-10 10:38:51,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:38:51,202 INFO L93 Difference]: Finished difference Result 2751 states and 4116 transitions. [2018-11-10 10:38:51,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:38:51,202 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 200 [2018-11-10 10:38:51,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:38:51,203 INFO L225 Difference]: With dead ends: 2751 [2018-11-10 10:38:51,203 INFO L226 Difference]: Without dead ends: 1567 [2018-11-10 10:38:51,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 395 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 10:38:51,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2018-11-10 10:38:51,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1235. [2018-11-10 10:38:51,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2018-11-10 10:38:51,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1849 transitions. [2018-11-10 10:38:51,292 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1849 transitions. Word has length 200 [2018-11-10 10:38:51,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:38:51,292 INFO L481 AbstractCegarLoop]: Abstraction has 1235 states and 1849 transitions. [2018-11-10 10:38:51,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:38:51,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1849 transitions. [2018-11-10 10:38:51,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-10 10:38:51,293 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:38:51,293 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, 1, 1] [2018-11-10 10:38:51,293 INFO L424 AbstractCegarLoop]: === Iteration 119 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:38:51,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:38:51,293 INFO L82 PathProgramCache]: Analyzing trace with hash 267768399, now seen corresponding path program 1 times [2018-11-10 10:38:51,294 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:38:51,294 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:38:51,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:38:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:38:53,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:38:53,680 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 10:38:53,682 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 10:38:53,685 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:38:53,686 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 10:38:53,687 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:53,692 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:53,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:53,708 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 10:38:53,708 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:38:53,720 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 10:38:53,723 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 10:38:53,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:53,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:53,741 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 10:38:53,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:38:53,772 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 10:38:53,772 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:38:53,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:38:53,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:38:53,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:38:53,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:38:53,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:38:53,777 INFO L87 Difference]: Start difference. First operand 1235 states and 1849 transitions. Second operand 7 states. [2018-11-10 10:38:56,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:38:56,798 INFO L93 Difference]: Finished difference Result 2561 states and 3829 transitions. [2018-11-10 10:38:56,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:38:56,798 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 203 [2018-11-10 10:38:56,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:38:56,799 INFO L225 Difference]: With dead ends: 2561 [2018-11-10 10:38:56,799 INFO L226 Difference]: Without dead ends: 1377 [2018-11-10 10:38:56,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 197 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 10:38:56,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2018-11-10 10:38:56,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1235. [2018-11-10 10:38:56,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2018-11-10 10:38:56,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1847 transitions. [2018-11-10 10:38:56,888 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1847 transitions. Word has length 203 [2018-11-10 10:38:56,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:38:56,888 INFO L481 AbstractCegarLoop]: Abstraction has 1235 states and 1847 transitions. [2018-11-10 10:38:56,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:38:56,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1847 transitions. [2018-11-10 10:38:56,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-10 10:38:56,889 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:38:56,889 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 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, 1] [2018-11-10 10:38:56,889 INFO L424 AbstractCegarLoop]: === Iteration 120 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:38:56,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:38:56,890 INFO L82 PathProgramCache]: Analyzing trace with hash 732613603, now seen corresponding path program 1 times [2018-11-10 10:38:56,890 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:38:56,890 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:38:56,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:38:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:38:59,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:38:59,215 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 10:38:59,217 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 10:38:59,220 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:38:59,223 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 10:38:59,223 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:59,230 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:59,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38:59,242 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 10:38:59,242 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:38:59,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 19 treesize of output 15 [2018-11-10 10:38:59,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 15 treesize of output 3 [2018-11-10 10:38:59,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:38:59,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:38: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 10:38:59,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:38:59,289 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-10 10:38:59,289 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:38:59,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:38:59,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:38:59,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:38:59,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:38:59,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:38:59,295 INFO L87 Difference]: Start difference. First operand 1235 states and 1847 transitions. Second operand 7 states. [2018-11-10 10:39:00,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:00,286 INFO L93 Difference]: Finished difference Result 2561 states and 3825 transitions. [2018-11-10 10:39:00,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:39:00,287 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 203 [2018-11-10 10:39:00,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:00,288 INFO L225 Difference]: With dead ends: 2561 [2018-11-10 10:39:00,288 INFO L226 Difference]: Without dead ends: 1377 [2018-11-10 10:39:00,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 197 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 10:39:00,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2018-11-10 10:39:00,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1235. [2018-11-10 10:39:00,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2018-11-10 10:39:00,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1845 transitions. [2018-11-10 10:39:00,377 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1845 transitions. Word has length 203 [2018-11-10 10:39:00,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:00,377 INFO L481 AbstractCegarLoop]: Abstraction has 1235 states and 1845 transitions. [2018-11-10 10:39:00,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:39:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1845 transitions. [2018-11-10 10:39:00,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-10 10:39:00,378 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:00,378 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 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, 1] [2018-11-10 10:39:00,378 INFO L424 AbstractCegarLoop]: === Iteration 121 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:00,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:00,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1135371285, now seen corresponding path program 1 times [2018-11-10 10:39:00,379 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:39:00,379 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:39:00,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:02,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:39:02,749 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 10:39:02,751 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 10:39:02,753 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:02,755 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 10:39:02,756 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:02,762 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:02,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:02,774 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 10:39:02,775 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:39:02,786 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 10:39:02,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 10:39:02,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:02,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:02,791 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 10:39:02,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:39:02,814 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-10 10:39:02,814 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:39:02,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:02,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:39:02,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:39:02,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:39:02,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:39:02,820 INFO L87 Difference]: Start difference. First operand 1235 states and 1845 transitions. Second operand 7 states. [2018-11-10 10:39:05,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:05,831 INFO L93 Difference]: Finished difference Result 2561 states and 3821 transitions. [2018-11-10 10:39:05,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:39:05,831 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 204 [2018-11-10 10:39:05,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:05,832 INFO L225 Difference]: With dead ends: 2561 [2018-11-10 10:39:05,833 INFO L226 Difference]: Without dead ends: 1377 [2018-11-10 10:39:05,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 198 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 10:39:05,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2018-11-10 10:39:05,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1235. [2018-11-10 10:39:05,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2018-11-10 10:39:05,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1843 transitions. [2018-11-10 10:39:05,927 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1843 transitions. Word has length 204 [2018-11-10 10:39:05,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:05,927 INFO L481 AbstractCegarLoop]: Abstraction has 1235 states and 1843 transitions. [2018-11-10 10:39:05,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:39:05,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1843 transitions. [2018-11-10 10:39:05,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-10 10:39:05,929 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:05,929 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 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, 1] [2018-11-10 10:39:05,929 INFO L424 AbstractCegarLoop]: === Iteration 122 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:05,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:05,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1122133144, now seen corresponding path program 1 times [2018-11-10 10:39:05,930 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:39:05,930 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:39:05,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:08,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:39:08,319 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 10:39:08,322 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 10:39:08,325 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:08,328 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 10:39:08,328 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:08,335 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:08,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:08,347 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 10:39:08,347 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:39:08,359 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 10:39:08,360 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 10:39:08,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:08,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:08,368 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 10:39:08,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:39:08,392 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-10 10:39:08,392 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:39:08,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:08,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:39:08,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:39:08,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:39:08,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:39:08,397 INFO L87 Difference]: Start difference. First operand 1235 states and 1843 transitions. Second operand 7 states. [2018-11-10 10:39:09,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:09,383 INFO L93 Difference]: Finished difference Result 2561 states and 3817 transitions. [2018-11-10 10:39:09,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:39:09,383 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 205 [2018-11-10 10:39:09,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:09,384 INFO L225 Difference]: With dead ends: 2561 [2018-11-10 10:39:09,384 INFO L226 Difference]: Without dead ends: 1377 [2018-11-10 10:39:09,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 199 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 10:39:09,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2018-11-10 10:39:09,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1235. [2018-11-10 10:39:09,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2018-11-10 10:39:09,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1841 transitions. [2018-11-10 10:39:09,482 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1841 transitions. Word has length 205 [2018-11-10 10:39:09,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:09,482 INFO L481 AbstractCegarLoop]: Abstraction has 1235 states and 1841 transitions. [2018-11-10 10:39:09,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:39:09,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1841 transitions. [2018-11-10 10:39:09,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-10 10:39:09,483 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:09,483 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 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, 1] [2018-11-10 10:39:09,483 INFO L424 AbstractCegarLoop]: === Iteration 123 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:09,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:09,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1374444048, now seen corresponding path program 1 times [2018-11-10 10:39:09,484 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:39:09,484 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/bin-2019/utaipan/cvc4nyu Starting monitored process 125 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 125 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:39:09,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:11,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:39:11,876 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 10:39:11,878 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 10:39:11,880 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:11,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 10:39:11,882 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:11,888 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:11,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:11,900 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 10:39:11,900 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:39:11,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 19 treesize of output 15 [2018-11-10 10:39:11,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 15 treesize of output 3 [2018-11-10 10:39:11,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:11,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:11,917 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 10:39:11,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:39:11,942 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-10 10:39:11,942 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:39:11,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:11,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:39:11,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:39:11,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:39:11,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:39:11,948 INFO L87 Difference]: Start difference. First operand 1235 states and 1841 transitions. Second operand 7 states. [2018-11-10 10:39:12,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:12,936 INFO L93 Difference]: Finished difference Result 2541 states and 3787 transitions. [2018-11-10 10:39:12,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:39:12,937 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 206 [2018-11-10 10:39:12,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:12,938 INFO L225 Difference]: With dead ends: 2541 [2018-11-10 10:39:12,938 INFO L226 Difference]: Without dead ends: 1357 [2018-11-10 10:39:12,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 200 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 10:39:12,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2018-11-10 10:39:13,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1235. [2018-11-10 10:39:13,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2018-11-10 10:39:13,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1839 transitions. [2018-11-10 10:39:13,039 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1839 transitions. Word has length 206 [2018-11-10 10:39:13,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:13,040 INFO L481 AbstractCegarLoop]: Abstraction has 1235 states and 1839 transitions. [2018-11-10 10:39:13,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:39:13,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1839 transitions. [2018-11-10 10:39:13,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-10 10:39:13,041 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:13,041 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, 1] [2018-11-10 10:39:13,041 INFO L424 AbstractCegarLoop]: === Iteration 124 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:13,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:13,042 INFO L82 PathProgramCache]: Analyzing trace with hash 857697873, now seen corresponding path program 1 times [2018-11-10 10:39:13,042 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:39:13,042 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:39:13,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:17,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:39:17,791 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 10:39:17,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:17,843 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 10:39:17,848 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 10:39:17,848 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:17,853 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:17,887 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 10:39:17,891 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 10:39:17,895 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:17,897 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 10:39:17,903 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:17,905 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:17,908 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:17,916 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 10:39:17,917 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:17,929 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:17,938 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:17,947 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:17,966 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 10:39:17,966 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:48, output treesize:14 [2018-11-10 10:39:18,017 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 10:39:18,022 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 10:39:18,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:18,042 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:18,057 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 10:39:18,061 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 10:39:18,061 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:18,080 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:18,089 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 10:39:18,134 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 10:39:18,134 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 10:39:18,163 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:39:18,184 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 10:39:18,206 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 10:39:18,238 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 10:39:18,238 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:119, output treesize:76 [2018-11-10 10:39:18,324 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 10:39:18,326 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 10:39:18,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:18,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:18,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 49 treesize of output 33 [2018-11-10 10:39:18,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 33 treesize of output 9 [2018-11-10 10:39:18,345 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:18,347 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:18,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:18,359 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:21 [2018-11-10 10:39:18,376 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 10:39:18,377 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 10:39:18,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:18,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:18,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:18,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:13 [2018-11-10 10:39:18,401 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 10:39:18,402 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 10:39:18,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:18,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:18,404 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 10:39:18,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:39:18,481 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 10:39:18,482 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:39:18,543 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 10:39:18,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 11 treesize of output 10 [2018-11-10 10:39:18,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:18,568 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:18,577 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 10:39:18,643 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:39:18,691 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 10:39:18,691 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 10:39:18,727 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 10:39:18,730 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 10:39:18,730 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:18,734 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:18,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2018-11-10 10:39:18,741 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:39:18,741 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:39:18,742 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 10:39:18,742 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:18,747 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:18,758 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 10:39:18,768 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 10:39:18,778 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 10:39:18,778 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:126, output treesize:10 [2018-11-10 10:39:18,897 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 10:39:18,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:39:18,902 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:39:18,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:19,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:39:19,214 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 10:39:19,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:19,274 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 10:39:19,278 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 10:39:19,287 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:19,294 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 10:39:19,301 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:19,304 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:19,306 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:19,320 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 10:39:19,320 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:19,349 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:19,371 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:19,392 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:19,437 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 10:39:19,441 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 10:39:19,446 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:19,452 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 10:39:19,457 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:19,460 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:19,462 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:19,474 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 10:39:19,474 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:19,489 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:19,499 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:19,509 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:19,537 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 10:39:19,538 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:58, output treesize:23 [2018-11-10 10:39:19,647 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 10:39:19,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 10:39:19,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:19,684 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:19,706 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 10:39:19,709 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 10:39:19,709 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:19,723 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:19,731 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 10:39:19,781 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 10:39:19,781 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 10:39:19,799 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:39:19,817 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 10:39:19,836 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 10:39:19,867 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 10:39:19,867 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:126, output treesize:90 [2018-11-10 10:39:19,950 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 10:39:19,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 28 treesize of output 27 [2018-11-10 10:39:19,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:19,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:19,969 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 10:39:19,972 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 10:39:19,972 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:19,974 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:19,983 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 10:39:19,984 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:19,991 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 10:39:19,993 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 10:39:19,993 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:19,994 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:19,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:20,000 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:71, output treesize:13 [2018-11-10 10:39:20,003 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 10:39:20,004 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 10:39:20,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:20,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:20,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 10:39:20,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:39:20,104 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 10:39:20,104 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:39:20,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 100 [2018-11-10 10:39:20,122 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 10:39:20,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:20,142 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:20,150 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 10:39:20,217 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:39:20,259 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 10:39:20,260 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 10:39:20,294 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 10:39:20,297 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:39:20,297 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:39:20,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2018-11-10 10:39:20,298 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:20,303 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:20,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 37 treesize of output 29 [2018-11-10 10:39:20,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 14 treesize of output 1 [2018-11-10 10:39:20,309 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:20,313 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:20,323 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 10:39:20,333 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 10:39:20,342 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 10:39:20,343 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:128, output treesize:10 [2018-11-10 10:39:20,402 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 10:39:20,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 10:39:20,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 8] total 19 [2018-11-10 10:39:20,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 10:39:20,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 10:39:20,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-11-10 10:39:20,422 INFO L87 Difference]: Start difference. First operand 1235 states and 1839 transitions. Second operand 19 states. [2018-11-10 10:39:38,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:38,016 INFO L93 Difference]: Finished difference Result 7559 states and 11206 transitions. [2018-11-10 10:39:38,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 10:39:38,016 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 206 [2018-11-10 10:39:38,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:38,020 INFO L225 Difference]: With dead ends: 7559 [2018-11-10 10:39:38,020 INFO L226 Difference]: Without dead ends: 6375 [2018-11-10 10:39:38,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 836 GetRequests, 805 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 10:39:38,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6375 states. [2018-11-10 10:39:38,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6375 to 1389. [2018-11-10 10:39:38,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1389 states. [2018-11-10 10:39:38,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 2103 transitions. [2018-11-10 10:39:38,139 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 2103 transitions. Word has length 206 [2018-11-10 10:39:38,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:38,139 INFO L481 AbstractCegarLoop]: Abstraction has 1389 states and 2103 transitions. [2018-11-10 10:39:38,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 10:39:38,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 2103 transitions. [2018-11-10 10:39:38,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-10 10:39:38,140 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:38,141 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, 1, 1, 1, 1] [2018-11-10 10:39:38,141 INFO L424 AbstractCegarLoop]: === Iteration 125 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:38,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:38,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1365187107, now seen corresponding path program 1 times [2018-11-10 10:39:38,141 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:39:38,141 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/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 10:39:38,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:40,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:39:40,029 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 10:39:40,030 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 10:39:40,035 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:40,037 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 10:39:40,037 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:40,043 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:40,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:40,056 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 10:39:40,056 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:39:40,069 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 10:39:40,070 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 10:39:40,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:40,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:40,072 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 10:39:40,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:39:40,100 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 10:39:40,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:39:40,120 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 10:39:40,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:40,120 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 10:39:40,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 10:39:40,137 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 10:39:40,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:39:40,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 10:39:40,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:39:40,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:39:40,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:39:40,142 INFO L87 Difference]: Start difference. First operand 1389 states and 2103 transitions. Second operand 9 states. [2018-11-10 10:39:45,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:45,625 INFO L93 Difference]: Finished difference Result 3065 states and 4610 transitions. [2018-11-10 10:39:45,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:39:45,626 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 207 [2018-11-10 10:39:45,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:45,627 INFO L225 Difference]: With dead ends: 3065 [2018-11-10 10:39:45,628 INFO L226 Difference]: Without dead ends: 1727 [2018-11-10 10:39:45,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 409 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 10:39:45,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2018-11-10 10:39:45,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1389. [2018-11-10 10:39:45,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1389 states. [2018-11-10 10:39:45,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 2097 transitions. [2018-11-10 10:39:45,741 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 2097 transitions. Word has length 207 [2018-11-10 10:39:45,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:45,741 INFO L481 AbstractCegarLoop]: Abstraction has 1389 states and 2097 transitions. [2018-11-10 10:39:45,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:39:45,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 2097 transitions. [2018-11-10 10:39:45,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-10 10:39:45,743 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:45,743 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, 1, 1] [2018-11-10 10:39:45,743 INFO L424 AbstractCegarLoop]: === Iteration 126 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:45,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:45,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1848185976, now seen corresponding path program 1 times [2018-11-10 10:39:45,744 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:39:45,744 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/bin-2019/utaipan/cvc4nyu Starting monitored process 129 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 129 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:39:45,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:50,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:39:50,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, 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 10:39:50,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:50,451 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 10:39:50,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 10:39:50,456 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:50,461 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:50,495 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 10:39:50,498 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 10:39:50,501 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:50,504 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 10:39:50,508 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:50,515 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:50,523 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:50,532 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 10:39:50,532 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:50,552 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:50,563 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:50,575 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:50,594 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 10:39:50,594 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:48, output treesize:14 [2018-11-10 10:39:50,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 78 [2018-11-10 10:39:50,634 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 10:39:50,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:50,653 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:50,668 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 10:39:50,672 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 10:39:50,672 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:50,692 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:50,702 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 10:39:50,751 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 10:39:50,751 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 10:39:50,772 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:39:50,794 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 10:39:50,823 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 10:39:50,857 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 10:39:50,858 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:119, output treesize:76 [2018-11-10 10:39:50,943 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 10:39:50,945 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 10:39:50,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:50,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:50,964 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 10:39:50,966 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 10:39:50,966 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:50,968 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:50,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:50,980 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:21 [2018-11-10 10:39:50,998 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 10:39:50,999 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 10:39:50,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:51,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:51,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:51,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:13 [2018-11-10 10:39:51,022 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 10:39:51,023 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 10:39:51,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:51,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:51,025 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 10:39:51,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:39:51,102 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 10:39:51,103 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:39:51,166 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 10:39:51,171 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 10:39:51,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:51,192 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:51,201 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 10:39:51,265 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:39:51,338 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 10:39:51,339 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 10:39:51,376 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 10:39:51,379 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 10:39:51,379 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:51,382 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:51,386 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 10:39:51,389 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:39:51,389 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:39:51,390 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 10:39:51,390 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:51,395 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:51,406 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 10:39:51,416 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 10:39:51,427 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 10:39:51,427 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:128, output treesize:10 [2018-11-10 10:39:51,547 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 10:39:51,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:39:51,553 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/bin-2019/utaipan/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:39:51,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:51,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:39:51,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 10:39:51,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:51,940 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 10:39:51,944 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 10:39:51,951 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:51,956 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 10:39:51,964 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:51,966 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:51,970 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:51,984 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 10:39:51,985 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:52,018 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:52,041 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:52,062 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:52,105 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 10:39:52,110 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 10:39:52,116 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:52,123 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 10:39:52,129 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:52,130 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:52,133 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:52,145 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 10:39:52,145 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:52,160 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:52,170 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:52,181 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:52,209 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 10:39:52,209 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:58, output treesize:23 [2018-11-10 10:39:52,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, 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 10:39:52,304 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 10:39:52,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:52,330 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:52,347 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 10:39:52,351 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 10:39:52,351 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:52,369 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:52,378 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 10:39:52,432 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 10:39:52,432 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 10:39:52,451 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:39:52,469 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 10:39:52,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 10:39:52,522 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 10:39:52,522 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:126, output treesize:90 [2018-11-10 10:39:52,614 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 10:39:52,617 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 10:39:52,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:52,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:52,635 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 10:39:52,637 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:39:52,638 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 10:39:52,638 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:52,644 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:52,655 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 10:39:52,657 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:39:52,657 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 10:39:52,658 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 10:39:52,665 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 10:39:52,673 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 10:39:52,675 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 10:39:52,675 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:52,677 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:52,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:52,684 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:71, output treesize:13 [2018-11-10 10:39:52,687 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 10:39:52,688 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 10:39:52,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:52,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:52,691 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 10:39:52,691 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:39:52,782 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 10:39:52,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:39:52,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 98 [2018-11-10 10:39:52,823 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 10:39:52,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:52,847 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:52,856 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 10:39:52,920 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:39:52,990 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 10:39:52,991 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 10:39:53,025 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 10:39:53,028 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:39:53,028 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:39:53,029 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 10:39:53,029 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:53,032 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:53,035 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 10:39:53,038 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 10:39:53,039 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:53,044 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:53,055 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 10:39:53,065 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 10:39:53,076 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 10:39:53,076 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:126, output treesize:10 [2018-11-10 10:39:53,137 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 10:39:53,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 10:39:53,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 8] total 19 [2018-11-10 10:39:53,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 10:39:53,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 10:39:53,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-11-10 10:39:53,157 INFO L87 Difference]: Start difference. First operand 1389 states and 2097 transitions. Second operand 19 states. [2018-11-10 10:40:11,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:40:11,174 INFO L93 Difference]: Finished difference Result 7117 states and 10636 transitions. [2018-11-10 10:40:11,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 10:40:11,175 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 207 [2018-11-10 10:40:11,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:40:11,179 INFO L225 Difference]: With dead ends: 7117 [2018-11-10 10:40:11,179 INFO L226 Difference]: Without dead ends: 5779 [2018-11-10 10:40:11,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 837 GetRequests, 808 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2018-11-10 10:40:11,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5779 states. [2018-11-10 10:40:11,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5779 to 1383. [2018-11-10 10:40:11,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1383 states. [2018-11-10 10:40:11,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 2087 transitions. [2018-11-10 10:40:11,311 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 2087 transitions. Word has length 207 [2018-11-10 10:40:11,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:40:11,311 INFO L481 AbstractCegarLoop]: Abstraction has 1383 states and 2087 transitions. [2018-11-10 10:40:11,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 10:40:11,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2087 transitions. [2018-11-10 10:40:11,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-11-10 10:40:11,312 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:40:11,313 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, 1, 1, 1, 1] [2018-11-10 10:40:11,313 INFO L424 AbstractCegarLoop]: === Iteration 127 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:40:11,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:40:11,313 INFO L82 PathProgramCache]: Analyzing trace with hash -166857986, now seen corresponding path program 1 times [2018-11-10 10:40:11,313 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:40:11,313 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/bin-2019/utaipan/cvc4nyu Starting monitored process 131 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 131 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:40:11,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:40:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:40:13,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:40:13,223 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 10:40:13,224 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 10:40:13,228 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:40:13,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:40:13,232 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:40:13,238 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:40:13,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:40:13,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 10:40:13,250 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:40:13,263 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 10:40:13,264 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 10:40:13,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:40:13,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:40:13,271 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 10:40:13,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:40:13,301 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 10:40:13,301 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:40:13,321 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 10:40:13,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:40:13,322 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 10:40:13,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 10:40:13,342 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 10:40:13,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:40:13,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 10:40:13,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:40:13,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:40:13,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:40:13,348 INFO L87 Difference]: Start difference. First operand 1383 states and 2087 transitions. Second operand 9 states. [2018-11-10 10:40:18,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:40:18,835 INFO L93 Difference]: Finished difference Result 3053 states and 4577 transitions. [2018-11-10 10:40:18,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:40:18,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 208 [2018-11-10 10:40:18,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:40:18,837 INFO L225 Difference]: With dead ends: 3053 [2018-11-10 10:40:18,837 INFO L226 Difference]: Without dead ends: 1721 [2018-11-10 10:40:18,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 411 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 10:40:18,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2018-11-10 10:40:18,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1383. [2018-11-10 10:40:18,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1383 states. [2018-11-10 10:40:18,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 2081 transitions. [2018-11-10 10:40:18,960 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 2081 transitions. Word has length 208 [2018-11-10 10:40:18,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:40:18,960 INFO L481 AbstractCegarLoop]: Abstraction has 1383 states and 2081 transitions. [2018-11-10 10:40:18,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:40:18,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2081 transitions. [2018-11-10 10:40:18,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-10 10:40:18,961 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:40:18,962 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, 1, 1, 1, 1, 1, 1] [2018-11-10 10:40:18,962 INFO L424 AbstractCegarLoop]: === Iteration 128 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:40:18,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:40:18,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1430859666, now seen corresponding path program 1 times [2018-11-10 10:40:18,963 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:40:18,963 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/bin-2019/utaipan/cvc4nyu Starting monitored process 132 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 132 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:40:18,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:40:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:40:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:40:28,570 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 10:40:28,592 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:40:28,593 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:40:28,594 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:40:28,594 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:40:28,594 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:40:28,594 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:40:28,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:40:28 BoogieIcfgContainer [2018-11-10 10:40:28,675 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 10:40:28,675 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:40:28,675 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:40:28,675 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:40:28,676 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:31:43" (3/4) ... [2018-11-10 10:40:28,678 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 10:40:28,692 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:40:28,692 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:40:28,692 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:40:28,693 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:40:28,693 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:40:28,693 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:40:28,773 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_95d82300-5d3b-4c9b-bd6d-1460eee38aad/bin-2019/utaipan/witness.graphml [2018-11-10 10:40:28,773 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:40:28,773 INFO L168 Benchmark]: Toolchain (without parser) took 529806.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 943.3 MB in the beginning and 949.4 MB in the end (delta: -6.1 MB). Peak memory consumption was 136.5 MB. Max. memory is 11.5 GB. [2018-11-10 10:40:28,774 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:40:28,774 INFO L168 Benchmark]: CACSL2BoogieTranslator took 805.37 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 771.5 MB in the end (delta: 171.8 MB). Peak memory consumption was 171.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:40:28,774 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 771.5 MB in the beginning and 1.1 GB in the end (delta: -362.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2018-11-10 10:40:28,774 INFO L168 Benchmark]: Boogie Preprocessor took 77.16 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: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. [2018-11-10 10:40:28,774 INFO L168 Benchmark]: RCFGBuilder took 3292.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 958.7 MB in the end (delta: 162.9 MB). Peak memory consumption was 162.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:40:28,775 INFO L168 Benchmark]: TraceAbstraction took 525413.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -4.7 MB). Free memory was 958.7 MB in the beginning and 968.9 MB in the end (delta: -10.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:40:28,775 INFO L168 Benchmark]: Witness Printer took 97.64 ms. Allocated memory is still 1.2 GB. Free memory was 968.9 MB in the beginning and 949.4 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2018-11-10 10:40:28,776 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 805.37 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 771.5 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 117.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 771.5 MB in the beginning and 1.1 GB in the end (delta: -362.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 77.16 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: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3292.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 958.7 MB in the end (delta: 162.9 MB). Peak memory consumption was 162.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 525413.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -4.7 MB). Free memory was 958.7 MB in the beginning and 968.9 MB in the end (delta: -10.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 97.64 ms. Allocated memory is still 1.2 GB. Free memory was 968.9 MB in the beginning and 949.4 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 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: 1774]: 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={1071380276: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={1071380276: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={1071380276: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={1071380276: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 [L1733] CALL, EXPR s->s3 [L1733] RET, EXPR s->s3 [L1733] CALL, EXPR (s->s3)->tmp.reuse_message [L1733] RET, EXPR (s->s3)->tmp.reuse_message [L1733] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1762] skip = 0 VAL [init=1, SSLv3_server_data={1071380276:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1071380276: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={1071380276: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 [L1733] CALL, EXPR s->s3 [L1733] RET, EXPR s->s3 [L1733] CALL, EXPR (s->s3)->tmp.reuse_message [L1733] RET, EXPR (s->s3)->tmp.reuse_message [L1733] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1762] skip = 0 VAL [init=1, SSLv3_server_data={1071380276:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1071380276: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 [L1602] CALL, EXPR s->session [L1602] RET, EXPR s->session [L1602] CALL, EXPR s->s3 [L1602] RET, EXPR s->s3 [L1602] CALL, EXPR (s->s3)->tmp.new_cipher [L1602] RET, EXPR (s->s3)->tmp.new_cipher [L1602] CALL (s->session)->cipher = (s->s3)->tmp.new_cipher [L1602] RET (s->session)->cipher = (s->s3)->tmp.new_cipher [L1603] COND FALSE !(! tmp___9) [L1609] ret = __VERIFIER_nondet_int() [L1610] COND FALSE !(blastFlag == 10) VAL [init=1, SSLv3_server_data={1071380276:0}] [L1613] COND FALSE !(blastFlag == 13) VAL [init=1, SSLv3_server_data={1071380276:0}] [L1616] COND FALSE !(blastFlag == 16) VAL [init=1, SSLv3_server_data={1071380276:0}] [L1619] COND FALSE !(blastFlag == 19) VAL [init=1, SSLv3_server_data={1071380276:0}] [L1627] COND FALSE !(ret <= 0) [L1632] CALL s->state = 8672 [L1632] RET s->state = 8672 [L1633] CALL s->init_num = 0 [L1633] RET s->init_num = 0 [L1634] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={1071380276:0}] [L1733] CALL, EXPR s->s3 [L1733] RET, EXPR s->s3 [L1733] CALL, EXPR (s->s3)->tmp.reuse_message [L1733] RET, EXPR (s->s3)->tmp.reuse_message [L1733] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1762] skip = 0 VAL [init=1, SSLv3_server_data={1071380276:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1071380276: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 [L1643] ret = __VERIFIER_nondet_int() [L1644] COND FALSE !(blastFlag == 11) VAL [init=1, SSLv3_server_data={1071380276:0}] [L1647] COND FALSE !(blastFlag == 14) VAL [init=1, SSLv3_server_data={1071380276:0}] [L1650] COND FALSE !(blastFlag == 17) VAL [init=1, SSLv3_server_data={1071380276:0}] [L1653] COND FALSE !(blastFlag == 20) VAL [init=1, SSLv3_server_data={1071380276:0}] [L1661] COND FALSE !(ret <= 0) [L1666] CALL s->state = 8448 [L1666] RET s->state = 8448 [L1667] CALL s->hit [L1667] RET s->hit [L1667] COND TRUE s->hit [L1668] CALL, EXPR s->s3 [L1668] RET, EXPR s->s3 [L1668] CALL (s->s3)->tmp.next_state = 8640 [L1668] RET (s->s3)->tmp.next_state = 8640 [L1672] CALL s->init_num = 0 [L1672] RET s->init_num = 0 [L1733] CALL, EXPR s->s3 [L1733] RET, EXPR s->s3 [L1733] CALL, EXPR (s->s3)->tmp.reuse_message [L1733] RET, EXPR (s->s3)->tmp.reuse_message [L1733] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1762] skip = 0 VAL [init=1, SSLv3_server_data={1071380276:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1071380276: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={1071380276: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 [L1733] CALL, EXPR s->s3 [L1733] RET, EXPR s->s3 [L1733] CALL, EXPR (s->s3)->tmp.reuse_message [L1733] RET, EXPR (s->s3)->tmp.reuse_message [L1733] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1762] skip = 0 VAL [init=1, SSLv3_server_data={1071380276:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1071380276: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={1071380276:0}] [L1574] COND FALSE !(blastFlag == 12) VAL [init=1, SSLv3_server_data={1071380276:0}] [L1577] COND FALSE !(blastFlag == 15) VAL [init=1, SSLv3_server_data={1071380276:0}] [L1580] COND FALSE !(blastFlag == 18) VAL [init=1, SSLv3_server_data={1071380276:0}] [L1774] __VERIFIER_error() VAL [init=1, SSLv3_server_data={1071380276:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 1 error locations. UNSAFE Result, 525.3s OverallTime, 128 OverallIterations, 8 TraceHistogramMax, 367.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 26004 SDtfs, 53344 SDslu, 66203 SDs, 0 SdLazy, 54059 SolverSat, 4650 SolverUnsat, 126 SolverUnknown, 0 SolverNotchecked, 339.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20633 GetRequests, 19779 SyntacticMatches, 4 SemanticMatches, 850 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1389occurred in iteration=124, 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: 5.4s AutomataMinimizationTime, 127 MinimizatonAttempts, 22610 StatesRemovedByMinimization, 125 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 4.5s SsaConstructionTime, 94.6s SatisfiabilityAnalysisTime, 44.6s InterpolantComputationTime, 17269 NumberOfCodeBlocks, 17269 NumberOfCodeBlocksAsserted, 131 NumberOfCheckSat, 20261 ConstructedInterpolants, 168 QuantifiedInterpolants, 15437725 SizeOfPredicates, 2144 NumberOfNonLiveVariables, 103718 ConjunctsInSsa, 2370 ConjunctsInUnsatCore, 149 InterpolantComputations, 124 PerfectInterpolantSequences, 20852/22901 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...